TY - GEN
T1 - Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure
AU - Cheng, Hsueh Chien
AU - Chiang, Tsung Che
AU - Fu, Li Chen
PY - 2009
Y1 - 2009
N2 - In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.
AB - In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.
UR - http://www.scopus.com/inward/record.url?scp=67650482966&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67650482966&partnerID=8YFLogxK
U2 - 10.1109/SCIS.2009.4927009
DO - 10.1109/SCIS.2009.4927009
M3 - Conference contribution
AN - SCOPUS:67650482966
SN - 9781424427574
T3 - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
SP - 15
EP - 21
BT - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
T2 - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009
Y2 - 30 March 2009 through 2 April 2009
ER -