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

Abstract

Abstract: 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.

Key words: reentrant hybrid flow shop scheduling, improved multi-objective salp swarm algorithm(IMSSA), array process, energy saving

摘要： TFT-LCD面板生产的阵列制程是可重入混合流水车间调度问题，采用一种改进多目标樽海鞘群算法对其进行优化求解。构建以最大完工时间、总拖期时间和总耗能为优化目标的数学规划模型；针对该问题结构特点，对基本多目标樽海鞘群算法进行了一系列改进操作，包括基于升序排列的随机键编码、PS方法解码、基于Lévy飞行的领导者个体位置更新方式，以及外部档案中非支配个体的变邻域搜索操作，并采用田口方法进行算法参数设置；最后通过对基准算例的数值实验，将改进多目标樽海鞘群算法与基本多目标樽海鞘群算法、多目标粒子群优化算法、快速非支配排序遗传算法进行对比，实验结果表明了改进多目标樽海鞘群算法的有效性。

关键词: 可重入混合流水车间调度, 改进多目标樽海鞘群算法, 阵列制程, 节能

CLC Number:

TP18

YAO Yuanyuan;YE Chunming. IMSSA for TFT-LCD Panel Array Process Scheduling Problem Considering Energy Saving[J]. China Mechanical Engineering.

姚远远;叶春明. 考虑节能的改进多目标樽海鞘群算法TFT-LCD面板阵列制程调度问题[J]. 中国机械工程.

References

[1]GEN M, ZHANG W, LIN L. Multiobjective Hybrid Genetic Algorithms for Manufacturing Scheduling:Part II Case Studies of HDD and TFT-LCD[C]∥Proceedings of the 9th International Conference on Management Science and Engineering Management (ICMSEM). Berlin:Springer, 2015:27-54.
[2]WANG M Y, SETHI S P, VANDEVELDE S L. Minimizing Makespan in a Class of Reentrant Shops[J]. Operations Research, 1997, 45(5):702-712.
[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[J]. International Journal of Advanced Manufacturing Technology, 2009, 42(9/10):963-973.
[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[J]. Expert Systems with Applications, 2011, 38(4):3514-3521.
[5]DUGARDIN F, YALAOUI F, AMODEO L. New Multi-objective Method to Solve Reentrant Hybrid Flow Shop Scheduling Problem[J]. European Journal of Operational Research, 2010, 203(1):22-31.
[6]CHO H M, BAE S J, KIM J, et al. Bi-objective Scheduling for Reentrant Hybrid Flow Shop Using Pareto Genetic Algorithm[J]. Computers and Industrial Engineering, 2011, 61(3):529-541.
[7]YING K C, LIN S W, WAN S Y. Bi-objective Reentrant Hybrid Flowshop Scheduling:an Iterated Pareto Greedy Algorithm[J]. International Journal of Production Research, 2014, 52(19):5735-5747.
[8]SHEN J N, WANG L, ZHENG H Y. A Modified Teaching-learning-based Optimization Algorithm for Bi-objective Re-entrant Hybrid Flowshop Scheduling[J]. International Journal of Production Research, 2016, 54(12):3622-3639.
[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[C]∥Proceedings of the 2nd International Conference on Harmony Search Algorithm. Berlin:Springer, 2016:435-445.
[10]CHO H M, JEONG I J. A Two-level Method of Production Planning and Scheduling for Bi-objective Reentrant Hybrid Flow Shops[J]. Computers and Industrial Engineering, 2017, 106:174-181.
[11]WOLPERT D H, MACREADY W G. No Free Lunch Theorems for Optimization[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):67-82.
[12]王凌, 王晶晶, 吴楚格. 绿色车间调度优化研究进展[J]. 控制与决策, 2018, 33(3):385-391.
WANG Ling, WANG Jingjing, WU Chuge. Advances in Green Shop Scheduling and Optimization[J]. Control and Decision, 2018, 33(3):385-391.
[13]LU C, GAO L, LI X Y, et al. Energy-efficient Permutation Flow Shop Scheduling Problem Using a Hybrid Multi-objective Backtracking Search Algorithm[J]. Journal of Cleaner Production, 2017, 144:228-238.
[14]LEI D M, ZHENG Y L, GUO X P. A Shuffled Frog-leaping Algorithm for Flexible Job Shop Scheduling with the Consideration of Energy Consumption[J]. International Journal of Production Research, 2017, 55(11):3126-3140.
[15]DENG J, WANG L, WU C G, et al. A Competitive Memetic Algorithm for Carbon-efficient Scheduling of Distributed Flow-shop[C]∥Proceedings of the 12th International Conference on Intelligent Computing. Lanzhou, 2016:476-488.
[16]杜浩, 陈琛. TFT-LCD制造企业节能减排管理模式研究[J]. 环境科学与管理, 2014, 39(12):20-24.
DU Hao, CHEN Chen. Analysis on Energy-saving and Emission-reduction Management Mode of TFT-LCD Manufacturing Enterprise[J]. Environmental Science and Management, 2014, 39(12):20-24.
[17]MIRJALILI S, GANDOMI A H, MIRJALILI S Z, et al. Salp Swarm Algorithm:a Bio-inspired Optimizer for Engineering Design Problems[J]. Advances in Engineering Software, 2017, 114:163-191.
[18]YANG X S. Nature-inspired Metaheuristic Algorithms[M]. 2 ed. Frome:Luniver Press, 2010:16.
[19]COELLO C A C, PULIDO G T, LECHUGA M S. Handling Multiple Objectives with Particle Swarm Optimization[J]. IEEE Transactions on Evolutionary Computation, 2004, 8(3):256-279.
[20]DEB K, PRATAP A, AGARWAL S, et al. A Fast and Elitist Multiobjective Genetic Algorithm:NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2):182-197.