Research of Just-in-time Scheduling for Assembly Job Shop

被引：0
|
作者：
Lü H. [1 ,2 ]
Zhu J. [1 ]
Wang Z. [1 ]
Wu S. [1 ,2 ]
机构：
[1] School of Logistics Engineering, Wuhan University of Technology, Wuhan
[2] Engineering Research Center for Port Logistics Technology and Equipment of Ministry of Education, Wuhan University of Technology, Wuhan
来源：
Jixie Gongcheng Xuebao/Journal of Mechanical Engineering | 2021年 / 57卷 / 05期
关键词：
Assembly job shop scheduling; Earliness and tardiness cost; Genetic algorithm; Heuristic;
D O I：
10.3901/JME.2021.05.157
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Although job shop scheduling problem (JSP) has been extensively and intensively studied in the past few decades, most research aims at minimizing regular measures. The scheduling of the problems with regular measures only needs to process as early as possible. Compared with regular measures, minimizing the sum of earliness/tardiness penalties is a non-regular measure. For the scheduling problems with non-regular measures, it is impossible to optimize the goal by processing all the operations as early as possible, and the schedule generation process must be more complicated. Aiming at the scheduling problem with earliness and tardiness penalties, the subject of research is expanded from simple job shop (JSP) to assembly job shop (AJSP) to explore the general law of earliness and tardiness scheduling problems more widely. A three-stage adjustment heuristic is designed to generate a schedule, and the heuristic is combined with genetic algorithm for experimental analysis. Compared with the results of optimal results, the efficiency and effectiveness of the heuristic is proved. In addition, experimental results also reveal the impact of different methods in the process of generating a schedule, which may serve as guidelines for future research. © 2021 Journal of Mechanical Engineering.
引用
收藏
页码：157 / 165
页数：8
相关论文
共 26 条
  • [1] BAKER K, SCUDDER G., Sequencing with earliness and tardiness penalties: A review, Operations Research, 38, 1, pp. 22-36, (1990)
  • [2] SOURD F, KEDAD-SIDHOUM S., The one-machine problem with earliness and tardiness penalties, Journal of Scheduling, 6, 6, pp. 533-549, (2003)
  • [3] BECK J C, REFALO P., A hybrid approach to scheduling with earliness and tardiness costs, Annals of Operations Research, 118, 1-4, pp. 49-71, (2003)
  • [4] MOSLEHI G, MIRZAEE M, VASEI M, Et al., Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness, International Journal of Production Economics, 122, 2, pp. 763-773, (2009)
  • [5] DOULABI S H H, AVAZBEIGI M, ARAB S, Et al., An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem, International Journal of Advanced Manufacturing Technology, 59, 9-12, pp. 1143-1155, (2012)
  • [6] REY G Z, BEKRAR A, TRENTESAUX D, Et al., Solving the flexible job-shop just-in-time scheduling problem with quadratic earliness and tardiness costs, The International Journal of Advanced Manufacturing Technology, 81, 1, pp. 9-12, (2015)
  • [7] AL-SALEM M, BEDOYA V L, RABADI G., Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Mathematical Problems in Engineering, (2016)
  • [8] LI Kai, ZHOU Chao, MA Ying, single machine JIT scheduling problem considering the release time, Operations Research and Management Science, 25, 3, pp. 71-77, (2016)
  • [9] LEE C Y, CHOI J Y., A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights, Computers & Operations Research, 22, 8, pp. 857-869, (1995)
  • [10] GUI Ling, Research on early/tardy scheduling problem with due windows, (2017)
123