What is it about?
We analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with the weighted late work criterion which is known to be NP-hard. In computational experiments, we compare the practical efficiency of a dynamic programming approach, an enumerative method and heuristic procedures. Test results showed that each solution method has its advantages.
Featured Image
Read the Original
This page is a summary of: Flow Shop Scheduling with Late Work Criterion – Choosing the Best Solution Strategy, January 2004, Springer Science + Business Media,
DOI: 10.1007/978-3-540-30176-9_9.
You can read the full text:
Contributors
The following have contributed to this page
