Real-Time Near-Optimal Scheduling With Rolling Horizon for Automatic Manufacturing Cell

This paper presents position-based optimization methods to schedule the production of automatic cells of a wheel manufacturing factory. Real-time schedule is challenging when a cell is interrupted by various order changes. Given a sequence of orders to be scheduled, it is sorted based on an earliest due day policy, a mixed integer linear programming model is formulated, and then rolling-horizon optimization methods are used to timely find the near-optimal schedule by minimizing earliness and tardiness penalties with setup times of a manufacturing cell. In addition, an original schedule can be partial rescheduled with the preset order sequence by using the linear programming model. Experimental results show that the proposed method enables a wheel manufacturing cell to reschedule its three to five daily orders within the cycle time of a rim when there exist order changes, e.g., rush orders and customized orders. Hence, these proposed methods are promising to promptly derive the near-optimal schedule for satisfying the objective of mass customization for industry 4.0.

[1]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[2]  Richard B. Chase,et al.  Operations Management , 2019, CCSP (ISC)2 Certified Cloud Security Professional Official Study Guide, 2nd Edition.

[3]  W. Kwon,et al.  Receding Horizon Control: Model Predictive Control for State Models , 2005 .

[4]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[5]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[6]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[7]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[8]  Mohammad Mohammadi,et al.  A rolling horizon-based heuristic to solve a multi-level general lot sizing and scheduling problem with multiple machines (MLGLSP_MM) in job shop manufacturing system , 2014 .

[9]  Ahmet B. Keha,et al.  Mixed integer programming formulations for single machine scheduling problems , 2009, Comput. Ind. Eng..

[10]  Tung-Kuan Liu,et al.  Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm , 2015, IEEE Access.

[11]  Suresh P. Sethi,et al.  Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography , 2001, Manuf. Serv. Oper. Manag..

[12]  James D. Blocher,et al.  A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem , 1996 .

[13]  Rym M'Hallah,et al.  Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP , 2014, Comput. Ind. Eng..

[14]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[15]  Ceyda Oguz,et al.  A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine , 2012, Comput. Oper. Res..

[16]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[17]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[18]  Muh-Cherng Wu,et al.  A cost model for justifying the acceptance of rush orders , 1996 .

[19]  Jeff S. Shamma,et al.  Further results on linear nonquadratic optimal control , 2001, IEEE Trans. Autom. Control..

[20]  Kenneth R. Baker,et al.  Solving the single-machine sequencing problem using integer programming , 2010, Comput. Ind. Eng..

[21]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[22]  Martín Gómez Ravetti,et al.  ANALYSIS OF MIXED INTEGER PROGRAMMING FORMULATIONS FOR SINGLE MACHINE SCHEDULING PROBLEMS WITH SEQUENCE DEPENDENT SETUP TIMES AND RELEASE DATES , 2019, Pesquisa Operacional.

[23]  E. H. Bowman THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[24]  Jairo R. Montoya-Torres,et al.  A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan , 2016, Comput. Oper. Res..