Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
Year of publication: |
June 2017
|
---|---|
Authors: | Lin, Bertrand M. T. ; Hwang, F. J. ; Gupta, Jatinder N. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 3, p. 293-302
|
Subject: | Flowshop | Three-operation job | Fixed job sequence | NP-hardness | Dynamic program | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Heuristik | Heuristics | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
-
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Gerstl, Enrique, (2020)
-
Aydilek, Asiye, (2015)
- More ...
-
Acquisition planning and scheduling of computing resources
Yang, Chien-Nan, (2016)
-
Relocation scheduling subject to fixed processing sequences
Lin, Bertrand M. T., (2016)
-
Robust scheduling for a two-stage assembly shop with scenario-dependent processing times
Wu, Chin-Chia, (2021)
- More ...