Learn More
New complexity results are derived. It is shown that the two machine flow shop problem with a single server is NP-hard if either the setup times or the processing times are constant. Furthermore, polynomial algorithms are given for special cases in which both setup times and processing times are constant. Flow-shop problems with a single server are(More)