Approximation schemes for two-machine flow shop scheduling with two agents
Year of publication: |
2012
|
---|---|
Authors: | Luo, Wenchang ; Chen, Lin ; Zhang, Guochuan |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 24.2012, 3, p. 229-239
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Madraki, Golshan, (2018)
-
An O(n log n) algorithm for the two-machine flow shop problem with variable machine speeds
Hoesel, C. P. van, (1993)
-
A note: common due data assignment for a single machine scheduling with the rate-modifying activity
Gordon, Valery S., (2009)
- More ...
-
An improved lower bound for rank four scheduling
Chen, Lin, (2014)
-
Parallel machine scheduling with speed-up resources
Chen, Lin, (2018)
-
Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming
Chen, Lin, (2015)
- More ...