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

被引:8
|
作者
Schultz, SR
Hodgson, TJ
King, RE
Taner, MR
机构
[1] N Carolina State Univ, Dept Ind Engn, Raleigh, NC 27695 USA
[2] Mercer Univ, Dept Mech & Ind Engn, Macon, GA 31207 USA
[3] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey
关键词
D O I
10.1080/00207540410001716561
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:4315 / 4330
页数:16
相关论文
共 50 条