Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
Year of publication: |
2020
|
---|---|
Authors: | Wang, Shijin ; Wu, Ruochen ; Chu, Feng ; Yu, Jianbo |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 118.2020, p. 1-17
|
Subject: | Emergency job | Identical parallel machine scheduling | Makespan | Maximum waiting time | Total completion time | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Mathematical formulations for the parallel machine scheduling problem with a single server
Elidrissi, Abdelhak, (2021)
-
Kim, Jae-Gon, (2020)
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
- More ...
-
Unrelated parallel machine scheduling problem with special controllable processing times and setups
Wang, Shijin, (2022)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production
Wang, Shijin, (2020)
- More ...