We show that finding minimum finish time preemptive and non-preemptive schedules for flow shops and job shops is NP-complete. Bounds on the performance of various heuristics to generate reasonably good schedules are also obtained.
No takes yet. Share an insight, caveat, or question.
Gonzalez et al. (1978) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: