What is it about?
This paper considers the two-machine flow shop problem with a common due date and the objective to minimize the late work. Some metaheuristic algorithms are briefly discussed.
Featured Image
Read the Original
This page is a summary of: Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date, January 2005, Springer Science + Business Media,
DOI: 10.1007/11551263_19.
You can read the full text:
Contributors
The following have contributed to this page
