A particle swarm optimization for multi-objective flowshop scheduling

被引:0
作者
D. Y. Sha
Hsing Hung Lin
机构
[1] National Chiao Tung University,Department of Industrial Engineering and Management
关键词
PSO; Multi-objective; Flowshop scheduling; Pareto optimal;
D O I
暂无
中图分类号
学科分类号
摘要
The academic approach of single-objective flowshop scheduling has been extended to multiple objectives to meet the requirements of realistic manufacturing systems. Many algorithms have been developed to search for optimal or near-optimal solutions due to the computational cost of determining exact solutions. This paper provides a particle swarm optimization-based multi-objective algorithm for flowshop scheduling. The proposed evolutionary algorithm searches the Pareto optimal solution for objectives by considering the makespan, mean flow time, and machine idle time. The algorithm was tested on benchmark problems to evaluate its performance. The results show that the modified particle swarm optimization algorithm performed better in terms of searching quality and efficiency than other traditional heuristics.
引用
收藏
页码:749 / 758
页数:9
相关论文
共 63 条
[1]  
Campbell HG(1970)A heuristic algorithm for the n-job m-machine sequencing problem Manage Sci 16 B630-B637
[2]  
Dudek RA(1978)Ordonnancements à contraintes disjonctives RAIRO Rech Oper. Oper Res 12 333-351
[3]  
Smith ML(1999)A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization Prod Plann Contr 10 707-714
[4]  
Carlier J(2007)The tricriteria flowshop scheduling problem Int J Adv Manuf Technol 36 1210-1220
[5]  
Chakravarthy K(2006)Flowshop scheduling research after five decades Eur J Oper Res 169 699-711
[6]  
Rajendran C(1993)Heuristic algorithms for scheduling in no-wait flow shop Int J Prod Econ 32 285-290
[7]  
Eren T(2005)Flowshop- scheduling problems with makespan criterion: a review Int J Prod Res 43 2895-2929
[8]  
Güner E(1960)Some numerical experiments for an MxJ flow shop and its decision- theoretical aspects Oper Res 8 178-184
[9]  
Gupta JND(2008)A combinational particle swarm optimisation for solving permutation flowshop problems Comput Ind Eng 54 526-538
[10]  
Stafford JEF(1995)Particle swarm optimization Proc IEEE Int Conf Neural Netw 1995 1942-1948