A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination
Year of publication: |
2021
|
---|---|
Authors: | Chen, Yong ; Zhang, An ; Tan, Zhiyi ; Xue, Ying ; Chen, Guangting |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 72.2021, 9, p. 1929-1942
|
Subject: | approximation algorithms | job delivery | Scheduling | worst-case ratio | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Scheduling to minimize the maximum total completion time per machine
Wan, Long, (2015)
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
-
Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
Grigoriu, Liliana, (2017)
- More ...
-
Approximate the scheduling of quay cranes with non-crossing constraints
Zhang, An, (2017)
-
Parallel machines scheduling with machine maintenance for minsum criteria
Tan, Zhiyi, (2011)
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
- More ...