Minimizing Lmax for the single machine scheduling problem with family set-ups
Date
2004
Authors
Schultz, S. R.
Hodgson, T. J.
King, R. E.
Taner, M. R.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
International Journal of Production Research
Print ISSN
0020-7543
Electronic ISSN
1366-588X
Publisher
Taylor & Francis
Volume
42
Issue
20
Pages
4315 - 4330
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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.
Course
Other identifiers
Book Title
Keywords
Algorithms, Approximation theory, Functions, Heuristic methods, Optimal control systems, Scheduling, Batch-partition heuristics, Machine scheduling problem, Pair-wise switching