What is it about?
This paper presents local search algoirthms for the NP-hard flow shop scheduling problem with two machines and secondary criterion: minimization of total flow time subject to a minimum makespan.
Featured Image
Read the Original
This page is a summary of: Local search heuristics for two-stage flow shop problems with secondary criterion, Computers & Operations Research, February 2002, Elsevier,
DOI: 10.1016/s0305-0548(00)00061-7.
You can read the full text:
Contributors
The following have contributed to this page
