A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems

This paper presents a robust approach to solve Hoist Scheduling Problems (HSPs) based on an integration of Constraint Logic Programming (CLP) and Mixed Integer Programming (MIP). By contrast with previous dedicated models and algorithms for solving classes of HSPs, we define only one model and run different solvers. The robust approach is achieved by using a CLP formalism. We show that our models for different classes of industrial HSPs are all based on the same generic model. In our hybrid algorithm search is separated from the handling of constraints. Constraint handling is performed by constraint propagation and linear constraint solving. Search is applied by labelling of boolean and integer variables. Computational experience shows that the hybrid algorithm, combining CLP and MIP solvers, solves classes of HSPs which cannot be handled by previous dedicated algorithms. For example, the hybrid algorithm derives an optimal solution, and proves its optimality, for multiple-hoists scheduling problems.

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

[2]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

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

[4]  Stephen F. Smith,et al.  A Constraint Satisfaction Approach to Makespan Scheduling , 1996, AIPS.

[5]  Alexander Bockmayr,et al.  Modelling mixed-integer optimisation problems in constraint logic programming , 1995 .

[6]  Claire Hanen,et al.  Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .

[7]  Kenneth McAloon,et al.  Optimization and computational logic , 1996, Wiley-Interscience series in discrete mathematics and optimization.

[8]  Henri Beringer,et al.  Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers , 1995, Logic Programming: Formal Methods and Practical Applications.

[9]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..

[10]  Mark Wallace,et al.  Towards a closer integration of finite domainpropagation and simplex-based algorithms , 1998, Ann. Oper. Res..

[11]  María Auxilio Osorio Lama,et al.  Mixed Logical-linear Programming , 1999, Discret. Appl. Math..

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

[13]  Lei Lei,et al.  Minimizing the fleet size with dependent time-window and single-track constraints , 1993, Oper. Res. Lett..

[14]  Sally C. Brailsford,et al.  The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.

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

[16]  Pascal Van Hentenryck,et al.  Solving Large Combinatorial Problems in Logic Programming , 1990, J. Log. Program..

[17]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.