Real-time scheduling of multi-stage flexible job shop floor

This paper first formulates a binary integer programming (BIP) model that minimises C max for a multi-stage flexible job shop floor with machine compatibility. Due to a computational limitation, the exact optimal model is then relaxed as a linear programming model. The output from the relaxation model then turns into the objective of the BIP-based real-time scheduling (RTS) heuristic model. The RTS heuristic requires an iteration to calculate the final C max. At each iteration, the RTS heuristic assigns just one job to the earliest available machines. Since the set of jobs and machines included in the RTS model is relatively small, RTS can be solved in a very short computational time. We evaluate an overall effectiveness (in terms of solution quality and run time) of the RTS heuristic by way of computer experiments.

[1]  Chompoonoot Kasemset,et al.  Bi-level multi-objective mathematical model for job-shop scheduling: the application of Theory of Constraints , 2010 .

[2]  Shi-Chung Chang,et al.  Daily scheduling for R&D semiconductor fabrication , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[3]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[4]  Tamás Kis,et al.  Computing lower and upper bounds for a large-scale industrial job shop scheduling problem , 2009, Eur. J. Oper. Res..

[5]  Arne Thesen,et al.  SEMI-MARKOV DECISION MODELS FOR REAL-TIME SCHEDULING , 1991 .

[6]  Ching-Jong Liao,et al.  An Improved Formulation for the Job-Shop Scheduling Problem , 1992 .

[7]  GILBERT LAPORTE,et al.  Exact algorithms for the job sequencing and tool switching problem , 2002 .

[8]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[9]  Mostafa Zandieh,et al.  A variable neighbourhood search algorithm for the flexible job-shop scheduling problem , 2010 .

[10]  John W. Fowler,et al.  Scheduling of unrelated parallel machines: an application to PWB manufacturing , 2002 .

[11]  M. Caramanis,et al.  Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems , 1998 .

[12]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[13]  J. M. Pinto,et al.  A Continuous Time Mixed Integer Linear Programming Model for Short Term Scheduling of Multistage Batch Plants , 1995 .

[14]  Chi Wai Hui,et al.  A novel MILP formulation for short-term scheduling of multi-stage multi-product batch plants with sequence-dependent constraints , 2000 .

[15]  César Rego,et al.  A filter-and-fan approach to the job shop scheduling problem , 2009, Eur. J. Oper. Res..

[16]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[17]  Gang Yu,et al.  Real-time disruption management in a two-stage production and inventory system , 2004 .

[18]  Jatinder N. D. Gupta,et al.  Comparative evaluation of MILP flowshop models , 2005, J. Oper. Res. Soc..

[19]  Minheekim,et al.  Simulation-based real-time scheduling in a flexible manufacturing system , 1994 .

[20]  James J. Solberg,et al.  Dynamic control in automated manufacturing: a knowledge integrated approach† , 1988 .

[21]  Don T. Phillips,et al.  Control of multiproduct bulk server diffusion/oxidation processes. Part 2: multiple servers , 2000 .

[22]  Sameer Kumar,et al.  Integrated simulation application design for short-term production scheduling , 2006 .

[23]  Don T. Phillips,et al.  Control of Multiproduct Bulk Service Diffusion/Oxidation Processes , 1992 .

[24]  Salah E. Elmaghraby,et al.  Sequencing Three-Stage Flexible Flowshops with Identical Machines to Minimize Makespan , 2001 .