IMSSA for TFT-LCD Panel Array Process Scheduling Problem Considering Energy Saving

被引：1
|
作者：
Yao Y. [1 ]
Ye C. [1 ]
机构：
[1] Business School, University of Shanghai for Science and Technology, Shanghai
来源：
Zhongguo Jixie Gongcheng/China Mechanical Engineering | 2019年 / 30卷 / 24期
关键词：
Array process; Energy saving; Improved multi-objective salp swarm algorithm(IMSSA); Reentrant hybrid flow shop scheduling;
D O I：
10.3969/j.issn.1004-132X.2019.24.014
中图分类号：
学科分类号：
摘要：
Array process of TFT-LCD panel manufacturing was a reentrant hybrid flow shop scheduling problem, and an effective IMSSA was proposed to solve the problem. Firstly, a multi-objective mathematical programming model with makespan, total tardiness, and total energy consumption criteria was formulated. Secondly, considering the characteristics of the problem, a series of improvements were made based on basic multi-objective salp swarm algorithm(MSSA), which included ranked order value based random key encoding, PS decoding methods, updating the position of the leading salps based on Lévy flight, and embedding a variable neighborhood search strategy in external archive. Influences of parameter setting were investigated by means of Taguchi method. Finally, the proposed IMSSA was compared with the basic MSSA, multi-objective particle swarm optimization (MOPSO) and fast nondominated sorting genetic algorithm (NSGA-Ⅱ) based on several benchmarking instances. Experimental results show the effectiveness of IMSSA. © 2019, China Mechanical Engineering Magazine Office. All right reserved.
引用
收藏
页码：2994 / 3003
页数：9
相关论文
共 20 条
  • [1] Gen M., Zhang W., Lin L., Multiobjective Hybrid Genetic Algorithms for Manufacturing Scheduling: Part II Case Studies of HDD and TFT-LCD, Proceedings of the 9th International Conference on Management Science and Engineering Management (ICMSEM), pp. 27-54, (2015)
  • [2] Wang M.Y., Sethi S.P., Vandevelde S.L., Minimizing Makespan in a Class of Reentrant Shops, Operations Research, 45, 5, pp. 702-712, (1997)
  • [3] Choi H.S., Kim H.W., Lee D.H., Et al., Scheduling Algorithms for Two-stage Reentrant Hybrid Flow Shops: Minimizing Makespan under the Maximum Allowable Due Dates, International Journal of Advanced Manufacturing Technology, 42, 9-10, pp. 963-973, (2009)
  • [4] Choi H.S., Kim J.S., Lee D.H., Real-time Scheduling for Reentrant Hybrid Flow Shops: a Decision Tree Based Mechanism and Its Application to a TFT-LCD Line, Expert Systems with Applications, 38, 4, pp. 3514-3521, (2011)
  • [5] Dugardin F., Yalaoui F., Amodeo L., New Multi-objective Method to Solve Reentrant Hybrid Flow Shop Scheduling Problem, European Journal of Operational Research, 203, 1, pp. 22-31, (2010)
  • [6] Cho H.M., Bae S.J., Kim J., Et al., Bi-objective Scheduling for Reentrant Hybrid Flow Shop Using Pareto Genetic Algorithm, Computers and Industrial Engineering, 61, 3, pp. 529-541, (2011)
  • [7] Ying K.C., Lin S.W., Wan S.Y., Bi-objective Reentrant Hybrid Flowshop Scheduling: an Iterated Pareto Greedy Algorithm, International Journal of Production Research, 52, 19, pp. 5735-5747, (2014)
  • [8] Shen J.N., Wang L., Zheng H.Y., A Modified Teaching-learning-based Optimization Algorithm for Bi-objective Re-entrant Hybrid Flowshop Scheduling, International Journal of Production Research, 54, 12, pp. 3622-3639, (2016)
  • [9] Shen J.N., Wang L., Deng J., Et al., A Pareto-based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem, Proceedings of the 2nd International Conference on Harmony Search Algorithm, pp. 435-445, (2016)
  • [10] Cho H.M., Jeong I.J., A Two-level Method of Production Planning and Scheduling for Bi-objective Reentrant Hybrid Flow Shops, Computers and Industrial Engineering, 106, pp. 174-181, (2017)
12