Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm

被引:72
作者
Zheng, Xu [1 ]
Zhou, Shengchao [2 ]
Xu, Rui [3 ]
Chen, Huaping [1 ]
机构
[1] Univ Sci & Technol China, Sch Management, Hefei, Anhui, Peoples R China
[2] Cent South Univ, Sch Automat, Changsha, Hunan, Peoples R China
[3] Hohai Univ, Sch Business, Nanjing, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
multi-objective optimisation; two-stage flow shop batch scheduling; hybrid ant colony optimisation; energy-efficient manufacturing; sustainable manufacturing; ELECTRICITY CONSUMPTION; MAKESPAN; TIME; MACHINES; MINIMIZE;
D O I
10.1080/00207543.2019.1642529
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Reducing energy costs has become an important concern for sustainable manufacturing systems, owing to concern for the environment. We present a multi-objective hybrid ant colony optimisation (MHACO) algorithm for a real-world two-stage blocking permutation flow shop scheduling problem to address the trade-off between total energy costs (TEC) and makespan () as measures of the service level with the time-of-use (TOU) electricity price. We explore the energy-saving potential of the manufacturing industry in consideration of the differential energy costs generated by variable-speed machines. A mixed integer programming model is developed to formulate this problem. In the MHACO algorithms, the max-min pheromone restriction rules and the local search rules avoid the localisation trap and enhance neighbourhood search capabilities, respectively. The Taguchi method and small-scale pilot experiments are employed to determine the appropriate experimental parameters. Based on three well-known multi-objective optimisation algorithms, viz., NSGAII, SPEA2, and MODEA, six algorithms with different batch-sorting methods are adopted as a comparison in small-, moderate-, and large-scale instances. A four-dimensional performance evaluation system is established to evaluate the obtained Pareto frontier approximations. The computational results show that the proposed MHACO-Johnson algorithm outperforms other algorithms in terms of solution quality, quantity, and distribution, although it is time consuming when dealing with moderate- to large-scale instances.
引用
收藏
页码:4103 / 4120
页数:18
相关论文
共 46 条
[1]   The Non-Permutation Flow-Shop scheduling problem: A literature review [J].
Alejandro Rossit, Daniel ;
Tohme, Fernando ;
Frutos, Mariano .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2018, 77 :143-153
[2]   A survey of scheduling problems with no-wait in process [J].
Allahverdi, Ali .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (03) :665-686
[3]  
[Anonymous], 2001, TIK report
[4]  
[Anonymous], 2016, SCHEDULING THEORY AL, DOI DOI 10.1007/978-3-319-26580-3
[5]   Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems [J].
Bewoor, Laxmi A. ;
Chandra Prakash, V. ;
Sapkal, Sagar U. .
Algorithms, 2017, 10 (04)
[6]  
BYRNE DM, 1987, QUAL PROG, V20, P19
[7]   A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops [J].
Chakravorty, Arindam ;
Laha, Dipak .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2017, 93 (9-12) :3759-3776
[8]   Synergy of Genetic Algorithm with Extensive Neighborhood Search for the Permutation Flowshop Scheduling Problem [J].
Chen, Rong-Chang ;
Chen, Jeanne ;
Chen, Tung-Shou ;
Huang, Chien-Che ;
Chen, Li-Chiu .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
[9]   A review of lot streaming [J].
Cheng, M. ;
Mukherjee, N. J. ;
Sarin, S. C. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (23-24) :7023-7046
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197