Article ID: | iaor20062047 |
Country: | Netherlands |
Volume: | 165 |
Issue: | 2 |
Start Page Number: | 389 |
End Page Number: | 407 |
Publication Date: | Sep 2005 |
Journal: | European Journal of Operational Research |
Authors: | Brucker Peter, Knust Sigrid, Wang Guoqing |
Keywords: | computational analysis |
Flow-shop problems with a single server are generalizations of classical flow-shop problems. Immediately before processing, each operation must be loaded onto the corresponding machine, which takes a certain setup time. These setup times are assumed to be separable from the processing times, i.e. a setup on a subsequent machine may be performed while the job is still processed on the preceding machine. All setups have to be done by a single server which can perform at most one setup at a time. New complexity results are derived for special cases.