A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
Year of publication: |
2009
|
---|---|
Authors: | Joo, B.-J. ; Kim, Y.-D. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 60.2009, 4, p. 572-582
|
Subject: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Heuristik | Heuristics | Warteschlangentheorie | Queueing theory | Produktionssteuerung | Production control |
-
Ozturk, Onur, (2017)
-
Block models for scheduling jobs on two parallel machines with a single server
Hasani, Keramat, (2014)
-
Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
Wang, Shijin, (2020)
- More ...
-
Joo, B.-J., (2007)
-
Joo, B.-J., (2009)
-
Park, M.-W., (2000)
- More ...