Using Optimization Models for Scheduling in Enterprise Resource Planning Systems

Companies often use specially-designed production systems and change them from time to time. They produce small batches in order to satisfy specific demands with the least tardiness. This imposes high demands on high-performance scheduling algorithms which can be rapidly adapted to changes in the production system. As a solution, this paper proposes a generic approach: solutions were obtained using a widely-used commercially-available tool for solving linear optimization models, which is available in an Enterprise Resource Planning System (in the SAP system for example) or can be connected to it. In a real-world application of a flow shop with special restrictions this approach is successfully used on a standard personal computer. Thus, the main implication is that optimal scheduling with a commercially-available tool, incorporated in an Enterprise Resource Planning System, may be the best approach.

[1]  Thomas E. Morton,et al.  Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[2]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[3]  Wheyming Tina Song,et al.  On the estimation of optimal batch sizes in the analysis of simulation output , 1996 .

[4]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[5]  Hartmut Stadtler,et al.  Improved rolling schedules for the dynamic single level lot sizing problem , 2000 .

[6]  Kenneth R. Baker,et al.  Computational results for the flowshop tardiness problem , 2013, Comput. Ind. Eng..

[7]  Karl Kurbel,et al.  Enterprise Resource Planning and Supply Chain Management: Functions, Business Processes and Software for Manufacturing Companies , 2013 .

[8]  Candace Aria Yano,et al.  Setting Planned Leadtimes in Serial Production Systems with Tardiness Costs , 1987 .

[9]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[10]  Peter Brucker,et al.  Complex Scheduling , 2006 .

[11]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[12]  F. Robert Jacobs,et al.  MANUFACTURING PLANNING AND CONTROL SYSTEMS FOR SUPPLY CHAIN MANAGEMENT , 2004 .

[13]  Thomas E. Morton,et al.  Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics , 1993 .

[14]  Christos T. Maravelias,et al.  Modeling of Storage in Batching and Scheduling of Multistage Processes , 2008 .

[15]  Peter Brucker.  Scheduling algorithms (4. ed.) , 2004 .

[16]  Henri Pierreval,et al.  Training a neural network to select dispatching rules in real time , 2010, Comput. Ind. Eng..

[17]  Mikael Rönnqvist,et al.  A new method for robustness in rolling horizon planning , 2013 .

[18]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[19]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[20]  Mehdi Serairi,et al.  The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies , 2013, Eur. J. Oper. Res..

[21]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[22]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[23]  Stefan Voß,et al.  Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application , 2007 .

[24]  Michel Minoux,et al.  A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints , 2012, Comput. Oper. Res..

[25]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

[26]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[27]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[28]  K. Preston White,et al.  A comparison of five steady-state truncation heuristics for simulation , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

[29]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[30]  Ahmed El-Bouri.  A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop , 2012, Comput. Oper. Res..

[31]  Sebastian Engell,et al.  Priority rules and predictive control algorithms for on-line scheduling of FMS , 1994 .

[32]  Li-Chen Fu,et al.  Rule-based scheduling in wafer fabrication with due date-based objectives , 2012, Comput. Oper. Res..

[33]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[34]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[35]  Bruce W. Schmeiser,et al.  Overlapping batch means: something for nothing? , 1984, WSC '84.

[36]  Knut Alicke,et al.  Dispatching in flowshops with bottleneck machines , 2007, Comput. Ind. Eng..

[37]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[38]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[39]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .