Minimizing L-max for the single machine scheduling problem with family set-ups
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.42, no.20, pp.4315-4330, 2004 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 42 Issue: 20
- Publication Date: 2004
- Doi Number: 10.1080/00207540410001716561
- Journal Name: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.4315-4330
- Open Archive Collection: AVESIS Open Access Collection
- TED University Affiliated: No
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.