Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times
Year of publication: |
2012
|
---|---|
Authors: | Ladhari, T. ; Msakni, M. K. ; Allahverdi, A. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 63.2012, 4, p. 445-459
|
Subject: | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Evolutionärer Algorithmus | Evolutionary algorithm | Produktionssystem | Manufacturing system | Produktionssteuerung | Production control | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Rakrouki, Mohamed Ali, (2012)
-
Janiak, Adam, (2001)
-
Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
Cheng, T. C. E., (2013)
- More ...
-
A branch-and-bound-based local search method for the flow shop problem
Haouari, M., (2003)
-
Technical Notes - Minimising maximum lateness in a two-machine flowshop
Haouari, M., (2000)
-
Minimizing maximum lateness in a flow shop subject to release dates
Haouari, M., (2007)
- More ...