Dynamic scheduling of production-assembly networks in a distributed environment

In complex manufacturing environments, meeting the due dates of the jobs and minimizing in process inventories are important performance metrics. One of the common characteristics of complex production systems is production-assembly network of operations. This paper presents an auction-based algorithm for simultaneous scheduling of all manufactured and assembled jobs in a dynamic environment, where the objective function is to minimize both the due date penalties associated with the final products and the inventory cost of the work in process. An auction-based approach using a Mixed-Integer Linear Programming (MILP) model to construct and evaluate the bids so that the auction mechanism mimics a Lagrangian relaxation-based subgradient optimization to ensure global optimality is proposed. The inner structure of the problem enables very efficient calculation of bids for each job or assembly. Using a full factorial experimental design the properties of the proposed algorithm are analyzed. Results show that the proposed auction based algorithm performs better than the popular dispatching rules and is more scalable than the MILP model or direct implementations of the subgradient algorithm. Furthermore, the proposed algorithm is designed to work in a dynamic environment.

[1]  Pius J. Egbelu,et al.  Scheduling for machining and assembly in a job-shop environment , 1993 .

[2]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[3]  B. Shnits,et al.  Multicriteria dynamic scheduling methodology for controlling a flexible manufacturing system , 2004 .

[4]  D.J. Hoitomt,et al.  Scheduling jobs with simple precedence constraints on parallel machines , 1990, IEEE Control Systems Magazine.

[5]  George Chryssolouris,et al.  Dynamic scheduling of manufacturing job shops using genetic algorithms , 2001, J. Intell. Manuf..

[6]  Richard A. Wysk,et al.  An application of discrete-event simulation to on-line control and scheduling in flexible manufacturing , 1989 .

[7]  D. Harrison,et al.  The Application of Parallel Multipopulation Genetic Algorithms to Dynamic Job-Shop Scheduling , 2000 .

[8]  T.C.E. Cheng,et al.  Analysis of material flow in a job shop with assembly operations , 1990 .

[9]  Yeong-Dae Kim,et al.  A real-time scheduling mechanism for a flexible manufacturing system: Using simulation and dispatching rules , 1998 .

[10]  Peter B. Luh,et al.  Scheduling products with bills of materials using an improved Lagrangian relaxation technique , 1994, IEEE Trans. Robotics Autom..

[11]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[12]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[13]  Yuehwern Yih,et al.  Integration of inductive learning and neural networks for multi-objective FMS scheduling , 1998 .

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

[15]  Velusamy Subramaniam,et al.  Reactive Recovery of Job Shop Schedules – A Review , 2002 .

[16]  D. H. Cummings,et al.  Minimizing production flow time in a process and assembly job shop , 1998 .

[17]  Mehmet Emin Aydin,et al.  Dynamic job-shop scheduling using reinforcement learning agents , 2000, Robotics Auton. Syst..

[18]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[19]  Michael J. Shaw,et al.  Intelligent Scheduling with Machine Learning Capabilities: The Induction of Scheduling Knowledge§ , 1992 .

[20]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[21]  S. Bikhchandani,et al.  Competitive Equilibrium in an Exchange Economy with Indivisibilities , 1997 .

[22]  S. David Wu,et al.  On combinatorial auction and Lagrangean relaxation for distributed resource scheduling , 1999 .

[23]  Sanjay B. Joshi,et al.  Auction-based distributed scheduling in a dynamic job shop environment , 2002 .

[24]  Joseph J. Talavage,et al.  A transient-based real-time scheduling algorithm in FMS , 1991 .

[25]  Damien Trentesaux,et al.  Hybrid approach to decision-making for job-shop scheduling , 1999 .

[26]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[27]  Sanjay B. Joshi,et al.  Dynamic single-machine scheduling under distributed decision-making , 2000 .

[28]  Yohanan Arzi,et al.  Neural network-based adaptive production control system for a flexible manufacturing cell under a random environment , 1999 .

[29]  Andrea Rossi,et al.  Dynamic scheduling of FMS using a real-time genetic algorithm , 2000 .

[30]  Masao Yokoyama,et al.  Hybrid flow-shop scheduling with assembly operations , 2001 .

[31]  Hyunbo Cho,et al.  A robust adaptive scheduler for an intelligent workstation controller , 1993 .