Real-time admission control in a queue-time loop production system

被引:1
作者
Nurdiansyah, Rudi [1 ,2 ]
Hong, I-Hsuan [1 ]
Lee, Pin-Kuan [1 ]
机构
[1] Natl Taiwan Univ, Inst Ind Engn, 1,Sect 4,Roosevelt Rd, Taipei 106, Taiwan
[2] Univ Negeri Malang, Dept Ind Engn, Jalan Semarang 5, Malang 65145, Indonesia
关键词
Scheduling; Queue time constraints; Phase-step method; Combinatorial Benders' cuts; COMBINATORIAL BENDERS CUTS; FLOWSHOP; DECOMPOSITION; ALGORITHM; MODEL;
D O I
10.1016/j.cie.2021.107617
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The typical flow shop production system with queue time constraints consists of a queue-time loop with multiple stages and a limit on queue time between two consecutive stages. This paper proposes a mixed integer linear programming (MILP) model to address the dynamic environment such as job arrivals and machine failures of the production system. We determine the admission control decision at each stage in a queue-time loop and then reschedule the production after the real-time status of job arrivals and machine availability are updated. The combinatorial Benders' cuts (CBC) is used to solve the MILP model which decomposes the variables into integer and continuous parts. In order to reduce the model's size, the phase-step method (PS) is proposed and then is combined with the CBC, called CBC-PS method. Further, the production schedule of a multistage queue-time loop is generated. We find that the CBC-PS method can reduce up to 39.1% of the number of scrap jobs compared to first-in-first-out (FIFO), threshold dispatching (TH), and reaction chains (RC) heuristics.
引用
收藏
页数:12
相关论文
共 44 条
[1]   Operating room scheduling and rescheduling: a rolling horizon approach [J].
Addis, Bernardetta ;
Carello, Giuliana ;
Grosso, Andrea ;
Tanfani, Elena .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2016, 28 (1-2) :206-232
[2]   Influence of capacity- and time-constrained intermediate storage in two-stage food production systems [J].
Akkerman, Renzo ;
van Donk, Dirk Pieter ;
Gaalman, Gerard .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (13) :2955-2973
[3]   Combinatorial Benders cuts for assembly line balancing problems with setups [J].
Akpinar, Sener ;
Elmi, Atabak ;
Bektas, Tolga .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (02) :527-537
[4]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[5]   Local scheduling problems submitted to global FIFO processing constraints [J].
Bernier, V ;
Frein, Y .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (08) :1483-1503
[6]   A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals [J].
Chen, Jiang Hang ;
Lee, Der-Horng ;
Cao, Jin Xin .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2012, 48 (01) :266-275
[7]   Combinatorial benders' cuts for mixed-integer linear programming [J].
Codato, Gianni ;
Fischetti, Matteo .
OPERATIONS RESEARCH, 2006, 54 (04) :756-766
[8]   A mixed integer linear programming model to optimize reverse logistics activities of end-of-life vehicles in Turkey [J].
Demirel, Eray ;
Demirel, Neslihan ;
Gokcen, Hacli .
JOURNAL OF CLEANER PRODUCTION, 2016, 112 :2101-2113
[9]   A rolling horizon job shop rescheduling strategy in the dynamic environment [J].
Fang, J ;
Xi, YG .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 1997, 13 (03) :227-232
[10]   A decomposition approach for the scheduling of a steel plant production [J].
Harjunkoski, I ;
Grossmann, IE .
COMPUTERS & CHEMICAL ENGINEERING, 2001, 25 (11-12) :1647-1660