A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem

被引:12
作者
Manupati, V. K. [1 ]
Rajyalakshmi, G. [1 ]
Chan, Felix T. S. [2 ]
Thakkar, J. J. [3 ]
机构
[1] VIT Univ, Sch Mech Engn, Dept Mfg, Vellore, Tamil Nadu, India
[2] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Kowloon, Hong Kong, Peoples R China
[3] Indian Inst Technol Kharagpur, Dept Ind & Syst Engn, Kharagpur 721302, W Bengal, India
来源
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES | 2017年 / 42卷 / 03期
关键词
Unrelated parallel machine; scheduling; meta-heuristics; NP-hard; MINLP; GENETIC ALGORITHM; LOCAL SEARCH; JOBS; MAKESPAN; MINIMIZE; DESIGN;
D O I
10.1007/s12046-017-0611-2
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper addresses a fuzzy mixed-integer non-linear programming (FMINLP) model by considering machine-dependent and job-sequence-dependent set-up times that minimize the total completion time, the number of tardy jobs, the total flow time and the machine load variation in the context of unrelated parallel machine scheduling (UPMS) problem. The above-mentioned multi-objectives were considered based on non-zero ready times, machine- and sequence-dependent set-up times and secondary resource constraints for jobs. The proposed approach considers unrelated parallel machines with inherent uncertainty in processing times and due dates. Since the problem is shown to be NP-hard in nature, it is a challenging task to find the optimal/near-optimal solutions for conflicting objectives simultaneously in a reasonable time. Therefore, we introduced a new multi-objective-based evolutionary artificial immune non-dominated sorting genetic algorithm (AI-NSGA-II) to resolve the above-mentioned complex problem. The performance of the proposed multi-objective AI-NSGA-II algorithm has been compared to that of multi-objective particle swarm optimization (MOPSO) and conventional non-dominated sorting genetic algorithm (CNSGA-II), and it is found that the proposed multi-objective-based hybrid meta-heuristic produces high-quality solutions. Finally, the results obtained from benchmark instances and randomly generated instances as test problems evince the robust performance of the proposed multi-objective algorithm.
引用
收藏
页码:391 / 403
页数:13
相关论文
共 39 条
[1]   A survey of scheduling problems with setup times or costs [J].
Allahverdi, Ali ;
Ng, C. T. ;
Cheng, T. C. E. ;
Kovalyov, Mikhail Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :985-1032
[2]   A tabu search algorithm for parallel machine total tardiness problem [J].
Bilge, Ü ;
Kiraç, F ;
Kurtulan, M ;
Pekgün, P .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (03) :397-414
[3]   Parallel machine selection and job scheduling to minimize machine cost and job tardiness [J].
Cao, D ;
Chen, MY ;
Wan, GH .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (08) :1995-2012
[4]   Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times [J].
Chang, Pei-Chann ;
Chen, Shih-Hsin .
APPLIED SOFT COMPUTING, 2011, 11 (01) :1263-1274
[5]  
Charrua Santos F, 2012, LOT SIZING SCHEDULIN, DOI [10.5772/50975, DOI 10.5772/50975]
[6]   Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints [J].
Chen, JF ;
Wu, TH .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (01) :81-89
[7]   Unrelated parallel machine scheduling with secondary resource constraints [J].
Chen, JF .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 26 (03) :285-292
[8]  
CHEN PC, 1992, 1992 IEEE INTERNATIONAL CONF ON ROBOTICS AND AUTOMATION : PROCEEDINGS, VOLS 1-3, P2346, DOI 10.1109/ROBOT.1992.220112
[9]   Loop layout design problem in flexible manufacturing systems using genetic algorithms [J].
Cheng, RW ;
Gen, M .
COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 34 (01) :53-61
[10]   A STATE-OF-THE-ART REVIEW OF PARALLEL-MACHINE SCHEDULING RESEARCH [J].
CHENG, TCE ;
SIN, CCS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 47 (03) :271-292