Minimizing Lmax for the single machine scheduling problem with family set-ups

Minimizing Lmax for the single machine scheduling problem with family set-ups

0.00 Avg rating0 Votes
Article ID: iaor20051744
Country: United Kingdom
Volume: 42
Issue: 20
Start Page Number: 4315
End Page Number: 4330
Publication Date: Jan 2004
Journal: International Journal of Production Research
Authors: , , ,
Keywords: heuristics
Abstract:

A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems.

Reviews

Required fields are marked *. Your email address will not be published.