Heuristics for predictive hoist scheduling problems

In this paper, we consider hoist scheduling problems in a job shop environment. For each job several operations can be operated on tanks, and their processing times are bounded. The objective is to assign resources to both processing and transport operations and then to schedule those tasks on each resource, without storage, while minimising makespan. A disjunctive graph is used to model the problem. It contains processing nodes, transportation nodes, and arcs to represent lower and upper bounds on processing and transportation times. Then a modified shifting bottleneck algorithm with a simple repair is used for finding sequences on resources. It is coupled with a first heuristic which repairs some sequences of transportation tasks. A second heuristic assigns and schedules transportation tasks one by one while arbitrating disjunctions. Various experiments on benchmarks show that our model and method are able to provide satisfying results. [Received 15 June 2012; Revised 3 January 2013; Accepted 7 June 2013]

[1]  G. Fleury.  Applications de méthodes stochastiques inspirées du recuit simulé à des problèmes d'ordonnancement , 1995 .

[2]  Marie-Ange Manier,et al.  A disjunctive graph and shifting bottleneck heuristics for multi hoists scheduling problem , 2011 .

[3]  Yun Jiang,et al.  Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution , 2002 .

[4]  Christian Bierwirth,et al.  A heuristic scheduling procedure for multi-item hoist production lines , 2007 .

[5]  Pengyu Yan,et al.  A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows , 2010 .

[6]  Sigrid Knust,et al.  Tabu search algorithms for job-shop problems with a single transport robot , 2005, Eur. J. Oper. Res..

[7]  Mohamed Benrejeb,et al.  Resolution of the two-part cyclic hoist scheduling problem with bounded processing times in complex lines’ configuration , 2012 .

[8]  Philippe Lacomme,et al.  A Disjunctive Graph for the Job-Shop with several robots , 2007 .

[9]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[10]  Kwang Hyung Lee,et al.  Multiagent systems for the hoist scheduling problem , 2001, 10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297).

[11]  Alain Hertz,et al.  on a Scheduling Problem in a Robotized Analytical System , 1996, Discret. Appl. Math..

[12]  Zhen Zhou,et al.  Multi-degree cyclic hoist scheduling with time window constraints , 2011 .

[13]  M. Gourgand,et al.  Couplage méthodes d'ordonnancement-simulation pour l'ordonnancement de systèmes industriels de traitement de surface , 1995 .

[14]  Krzysztof Fleszar,et al.  A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem , 2004, Comput. Ind. Eng..

[15]  Pengyu Yan,et al.  A tabu search algorithm with solution space partition and repairing procedure for cyclic robotic cell scheduling problem , 2012 .

[16]  Marie-Ange Manier,et al.  Control of an electroplating line in the max and min algebras , 1999, Int. J. Syst. Sci..

[17]  L. Lei,et al.  DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINE , 1994 .

[18]  Eugene Levner,et al.  Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints , 2008, Eur. J. Oper. Res..

[19]  Lei Lei,et al.  The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints , 1991 .

[20]  Marie-Ange Manier,et al.  An Evolutionary Approach for the Design and Scheduling of Electroplating Facilities , 2008, J. Math. Model. Algorithms.

[21]  Marie-Ange Manier,et al.  A Classification for Hoist Scheduling Problems , 2003 .

[22]  Bernard Penz,et al.  Three-tank hoist scheduling problem with unbounded or zero-width processing windows , 2003 .

[23]  Chengbin Chu,et al.  Cyclic hoist scheduling in large real-life electroplating lines , 2007, OR Spectr..

[24]  L. W. Phillips,et al.  Mathematical Programming Solution of a Hoist Scheduling Program , 1976 .

[25]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[26]  M. Benrejeb,et al.  Hoist Scheduling for multi-part CHSP in complex lines' configuration , 2011, 2011 IEEE International Conference on Industrial Technology.

[27]  Henry L. W. Nuttle,et al.  Hoist Scheduling For A PCB Electroplating Facility , 1988 .

[28]  M. Benrejeb,et al.  Genetic algorithm for a cyclic Hoist Scheduling Problem with time-window constraints and heterogeneous part jobs , 2010, 18th Mediterranean Conference on Control and Automation, MED'10.

[29]  Neil Yorke-Smith,et al.  An Improved Hybrid Model for the Generic Hoist Scheduling Problem , 2002, Ann. Oper. Res..

[30]  Jacques Lamothe,et al.  A dynamic heuristic for the real time hoist scheduling problem , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[31]  Marie-Ange Manier,et al.  A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times , 2012, Comput. Oper. Res..

[32]  Erwin Pesch,et al.  The disjunctive graph machine representation of the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[33]  Dae-Won Kim,et al.  A contract net based intelligent agent system for solving the reactive hoist scheduling problem , 2006, Expert Syst. Appl..

[34]  Bruno Legeard,et al.  Résolution d'un problème d'ordonnancement avec la PLC , 1996 .