Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
Year of publication: |
2021
|
---|---|
Authors: | Chen, Rubing ; Yuan, Jinjiang ; Ng, C. T. ; Cheng, T. C. E. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 293.2021, 1 (16.8.), p. 79-92
|
Subject: | Hierarchical criteria | Preemption | Release date | Scheduling | Total completion time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Heuristik | Heuristics | Terminplanung | Time scheduling | Branch-and-Bound | Branch and Bound |
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
-
Total completion time with markespan constraint in no-wait flowshops with setup times
Allahverdi, Ali, (2014)
-
Minimizing total completion time on a single machine with step improving jobs
Kim, Eun-Seok, (2015)
- More ...
-
Chen, Rubing, (2024)
-
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Li, Shisheng, (2011)
-
Fu, Ruyan, (2013)
- More ...