Two parallel identical machines scheduling to minimise the maximum inter-completion time
Year of publication: |
2020
|
---|---|
Authors: | Zheng, Feifeng ; Sui, Yang ; Zhang, E. ; Xu, Yinfeng ; Liu, Ming |
Subject: | heuristic algorithm | inter-completion time | parallel machines | scheduling | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Ozturk, Onur, (2017)
-
Lopez-Esteve, Axel, (2023)
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
- More ...
-
Online deadline scheduling with preemption penalties
Zheng, Feifeng, (2011)
-
Online scheduling with immediate and reliable lead-time quotation
Zheng, Feifeng, (2014)
-
Zheng, Feifeng, (2022)
- More ...