Machine Selection Rules in a Dynamic Job Shop

With the increasing use of multipurpose machining centres in job shops, the scheduling problem can no longer neglect multiple job-routes. Existing scheduling approaches seldom address flexibility in job routes and the aim of this paper is to demonstrate that significant improvements to the scheduling performance of dispatching rules can be achieved easily through the use of simple machine selection rules. Three such rules are proposed in this paper and their effectiveness is evaluated through a simulation study of a dynamic job shop. In addition, three dynamic conditions, namely, the tightness of due dates, the flexibility of the job routes and the reliability of the machines, are varied to ensure that the simulation is performed for significantly different job shop conditions. The results of the simulation study indicate that improvements to the performance of simple dispatching rules are significantly enhanced when used with machine selection rules.

[1]  Ranga V. Ramasesh Dynamic job shop scheduling: A survey of simulation research , 1990 .

[2]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[3]  Yoshiyasu Takefuji,et al.  Job-shop scheduling based on modified tank-hopfield linear programming networks , 1994 .

[4]  George Chryssolouris,et al.  Manufacturing Systems: Theory and Practice , 1992 .

[5]  Velusamy Subramaniam,et al.  Scheduling of manufacturing systems based on extreme value theory and genetic algorithms , 1995 .

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

[7]  Kazuhiko Kawamura,et al.  Managing genetic search in job shop scheduling , 1993, IEEE Expert.

[8]  M. A. Townsend,et al.  Two-stage heuristic procedure for scheduling job shops , 1993 .

[9]  Bernard Grabot,et al.  Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach , 1994 .

[10]  Rong-Kwei Li,et al.  A heuristic rescheduling algorithm for computer-based production scheduling systems , 1993 .

[11]  Soumen Ghosh,et al.  An evaluation of the interaction between dispatching rules and truncation procedures in job-shop scheduling , 1993 .

[12]  K. Itoh,et al.  Twofold look-ahead search for multi-criterion job shop scheduling , 1993 .

[13]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[14]  Jacobus E. Rooda,et al.  NEURAL NETWORKS FOR JOB-SHOP SCHEDULING , 1994 .

[15]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[16]  Stanley B. Gershwin,et al.  Manufacturing Systems Engineering , 1993 .

[17]  S. T. Enns Job shop flowtime prediction and tardiness control using queueing analysis , 1993 .

[18]  Luís M. M. Custódio,et al.  Production planning and scheduling using a fuzzy decision system , 1994, IEEE Trans. Robotics Autom..

[19]  M. J. Zeestraten The look ahead dispatching procedure , 1990 .

[20]  Hong C. Zhang,et al.  A Simulation Study of an Object-Oriented Integration Testbed for Process Planning and Production Scheduling , 1999 .