New heuristic for scheduling re-entrant production lines

被引:2
|
作者
Yalaoui, Naim [1 ,2 ]
Camara, Mema [1 ]
Amodeo, Lionel [1 ]
Yalaoui, Farouk [1 ]
Mahdi, Halim [2 ]
机构
[1] Univ Technol Troyes, Inst Charles Delauney, LOSI, FRE CNRS 2848, 12 Rue Marie Curie, F-10012 Troyes, France
[2] Caillau Co, F-92130 Issy Les Moulineaux, France
关键词
Scheduling; re-entrant system; hybrid flow shop; heuristics; MINIMIZING MAKESPAN; SEQUENCING PROBLEM; JOB SHOPS; ALGORITHM; MINIMIZATION; FLOWSHOP;
D O I
10.1109/ICCIE.2009.5223776
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Today, the scheduling production problem attracts the academic and industrial researchers. This scheduling problem occurs in different types of workshop. However, our study is on an hybrid flow shop scheduling problem type, where the stages are in series and each one is composed of some identical parallel machines. In this hybrid flow shop, orders must be arranged. Each order is composed of several batches with the same due date and can be treated by any machine. Those of some orders must visit twice the stages, and then some flows are re-entrant. Several heuristics are proposed to solve this scheduling problem; the objective is to minimize the total tardiness of the orders. In these algorithms, the list-scheduling method is used. The numerical tests are applied on randomly generated problems. The results show that the proposed algorithm dominates the existing ones.
引用
收藏
页码:199 / +
页数:3
相关论文
共 50 条
  • [1] A Heuristic for Variable Re-Entrant Scheduling Problems
    van der Tempel, Roel
    van Pinxten, Joost
    Geilen, Marc
    Waqas, Umar
    [J]. 2018 21ST EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD 2018), 2018, : 336 - 341
  • [2] A heuristic algorithm for two-machine re-entrant shop scheduling
    Drobouchevitch, IG
    Strusevich, VA
    [J]. ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 417 - 439
  • [3] An analytical investigation of the scheduling problem for capacitated re-entrant lines
    Choi, JY
    Reveliotis, S
    [J]. 2002 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS, 2002, : 3193 - 3198
  • [4] Scheduling of re-entrant lines with neuro-dynamic programming based on a new evaluating criterion
    Wang, Ying
    Jin, Huiyu
    Zhu, Shunzhi
    Li, Maoqing
    [J]. ADVANCES IN NEURAL NETWORKS - ISNN 2006, PT 3, PROCEEDINGS, 2006, 3973 : 921 - 926
  • [5] Workload minimization in re-entrant lines
    Koole, Ger
    Pot, Auke
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (01) : 216 - 233
  • [6] A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer
    Waqas, Umar
    Geilen, Marc
    Kandelaars, Jack
    Somers, Lou
    Basten, Twan
    Stuijk, Sander
    Vestjens, Patrick
    Corporaal, Henk
    [J]. 2015 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2015, : 573 - 578
  • [7] Design and Implementation of Simulation-Based Scheduling System with Reinforcement Learning for Re-Entrant Production Lines
    Jeon, Seung-Woo
    Lee, Donggun
    Oh, Seog-Chan
    Park, Kyu-Tae
    Noh, Sang-Do
    Arinez, Jorge
    [J]. MACHINES, 2022, 10 (12)
  • [8] Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines
    Kim, H-W
    Lee, D-H
    [J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2009, 223 (04) : 433 - 442
  • [9] Simulation framework of scheduling re-entrant lines with nuero-dynamic programming
    Wang Ying
    Zhu Shunzhi
    Xu Wei
    Miao Kehua
    Li Maoqing
    [J]. ICCSE'2006: Proceedings of the First International Conference on Computer Science & Education: ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, 2006, : 176 - 181
  • [10] Optimal Stochastic Production Scheduling for Uncertain Re-entrant Assembly Workshops
    Jiang, Nanyun
    Yan, Hongsen
    [J]. PROCEEDINGS OF THE 2015 4TH INTERNATIONAL CONFERENCE ON COMPUTER, MECHATRONICS, CONTROL AND ELECTRONIC ENGINEERING (ICCMCEE 2015), 2015, 37 : 435 - 440