A new three-machine shop scheduling : complexity and approximation algorithm
Year of publication: |
2013
|
---|---|
Authors: | Dong, Jianming ; Chen, Yong ; Zhang, An ; Yang, Qifan |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 4, p. 799-810
|
Subject: | Open shop | Flow shop | Approximation algorithm | Worst-case analysis | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Produktionssteuerung | Production control | Konsumentenverhalten | Consumer behaviour | Theorie | Theory |
-
Two-machine flow shop and open shop scheduling problems with a single maintenance window
Mosheiov, Gur, (2018)
-
Worst case analysis of flow shop scheduling problems with a time-dependent learning effect
Li, Gang, (2013)
-
A cyclical search for the two machine flow shop and open shop to minimise finishing time
Soper, Alan J., (2015)
- More ...
-
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)
-
Chen, Yong, (2021)
- More ...