.png){kind=icon}
.png){kind=icon}
Return
Complexity results for flow-shop problems with a single server
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.04.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2004 Elsevier B.V. All rights reserved.
Keywords:
complexity results
flow-shop
setup times
single server
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available