Extending CHIP in order to solve complex scheduling and placement problems

In this paper, we show how the introduction of a new primitive constraint over finite domains in the constraint logic programming system CHIP allows us to find very good solutions for a large class of very difficult scheduling and placement problems. Examples on the cumulative scheduling problem, the 10 jobs x 10 machines problem, the perfect square problem, the strip packing problem and the incomparable rectangles packing problem are given, showing the versatility, the efficiency and the broad range of application of this new constraint. We point out that no other existing approach can address simultaneously all the problems discussed in this paper.

[1]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[2]  Pascal Van Hentenryck,et al.  Applications of CHIP to industrial and engineering problems , 1988, IEA/AIE '88.

[3]  Pascal Van Hentenryck,et al.  The Cardinality Operator: A New Logical Connective for Constraint Logic Programming , 1990, WCLP.

[4]  A. J. W. Duijvestijn,et al.  Simple perfect squared square of lowest order , 1978, J. Comb. Theory, Ser. B.

[5]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[6]  M. Biroá.  Object-oriented interaction in resource constrained scheduling , 1990 .

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

[8]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

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

[10]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

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

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Christopher Tong,et al.  Toward an engineering science of knowledge-based design , 1987, Artif. Intell. Eng..

[14]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[15]  Jean-Louis Laurière,et al.  A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..

[16]  Charles E. Pfefferkorn,et al.  A heuristic problem solving design system for equipment or furniture layouts , 1975, Commun. ACM.

[17]  E. Pinson.  Le probleme de job-shop , 1988 .

[18]  Brenda S. Baker,et al.  A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.

[19]  Hervé Gallaire.  Boosting Logic Programming , 1987, ICLP.

[20]  Miklós Biró.  Object-Oriented Interaction in Resource Constrained Scheduling , 1990, Inf. Process. Lett..

[21]  J. Grabowski.  A New Algorithm of Solving the Flow — Shop Problem , 1982 .

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

[23]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[24]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[25]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[26]  Nicolas Beldiceanu,et al.  Overview of the CHIP Compiler System , 1993, WCLP.

[27]  Takao Asano,et al.  A dynamic algorithm for placing rectangles without overlapping , 1991 .