Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop

A new, cooperative job dispatching approach is presented to minimize the mean flowtime in dynamic flowshops. A dispatching decision taken at any machine is reached collectively through consultation with other machines, and conflicting priorities are resolved by employing a penalty-based procedure. Computer results indicate that the proposed cooperative dispatching gives improvements ranging between 1.5% and 11.4% over other dispatching rules, under different levels of shop congestion, and for flowshops possessing various combinations of intermediate FIFO (first-come first-served) and non-FIFO buffers.

[1]  Ahmed El-Bouri,et al.  A neural network for dispatching rule selection in a job shop , 2006 .

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

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

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

[5]  Marco Garetti,et al.  On-line loading and dispatching in flexible manufacturing systems , 1990 .

[6]  L. N. Van Wassenhove,et al.  Analysis of Scheduling Rules for an FMS , 1990 .

[7]  Ning Liu,et al.  A Complete Multiagent Framework for Robust and Adaptable Dynamic Job Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[8]  J. R. Shah,et al.  Performance of priority rules in a due date flow shop , 1992 .

[9]  John L. Hunsucker,et al.  Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment , 1994 .

[10]  Yuehwern Yih,et al.  Intelligent FMS scheduling using modular neural networks , 1993, IEEE International Conference on Neural Networks.

[11]  Stefano Riemma,et al.  A negotiation scheme for autonomous agents in job shop scheduling , 2002, Int. J. Comput. Integr. Manuf..

[12]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

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

[14]  Neil A. Duffie,et al.  Nonhierarchical control of manufacturing systems , 1986 .

[15]  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 .

[16]  Katia P. Sycara,et al.  Coordination of multiple agents for production management , 1997, Ann. Oper. Res..

[17]  Pierre Massotte,et al.  Comparison of negotiation protocols in dynamic agent-based manufacturing systems , 2006 .

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

[19]  Neil A. Duffie,et al.  Real-time distributed scheduling of heterarchical manufacturing systems , 1994 .

[20]  Arianna Alfieri.  Due date quoting and scheduling interaction in production lines , 2007, Int. J. Comput. Integr. Manuf..

[21]  Yuehwern Yih,et al.  A learning-based methodology for dynamic scheduling in distributed manufacturing systems , 1995 .

[22]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

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

[24]  Ahmet B. Keha,et al.  Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times , 2007, Comput. Oper. Res..

[25]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

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

[27]  Yuehwern Yih,et al.  A competitive neural network approach to multi-objective FMS scheduling , 1998 .

[28]  Cerry M. Klein,et al.  A new rule for minimizing the number of tardy jobs in dynamic flow shops , 2004, Eur. J. Oper. Res..

[29]  Ihsan Sabuncuoglu,et al.  Dynamic dispatching algorithm for scheduling machines and automated guided vehicles in a flexible manufacturing system , 1992 .

[30]  Joong-In Kim,et al.  Multi-criteria operational control rules in flexible manufacturing systems (FMSs) , 1990 .

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

[32]  Michael J. Shaw,et al.  Dynamic scheduling in cellular manufacturing systems: A framework for networked decision making , 1988 .

[33]  James J. Solberg,et al.  INTEGRATED SHOP FLOOR CONTROL USING AUTONOMOUS AGENTS , 1992 .

[34]  Gerhard Weiss,et al.  Learning to Coordinate Actions in Multi-Agent-Systems , 1993, IJCAI.

[35]  David de la Fuente,et al.  A comparison of machine-learning algorithms for dynamic scheduling of flexible manufacturing systems , 2006, Eng. Appl. Artif. Intell..

[36]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[37]  Gary D. Scudder,et al.  The use of cost-based priorities in random and flow shops , 1987 .

[38]  Jürgen Branke *,et al.  Anticipation and flexibility in dynamic scheduling , 2005 .

[39]  Shinichi Nakasuka,et al.  Dynamic scheduling system utilizing machine learning as a knowledge acquisition tool , 1992 .

[40]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[41]  Richard Y. K. Fung,et al.  Dynamic shopfloor scheduling in multi-agent manufacturing systems , 2006, Expert Syst. Appl..

[42]  Averill M. Law,et al.  Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures , 1984, Oper. Res..

[43]  Parag C. Pendharkar,et al.  A computational study on design and performance issues of multi-agent intelligent systems for dynamic scheduling environments , 1999 .

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

[45]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[46]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .