A Position-Based Propagator for the Open-Shop Problem

Authors:
Jean-Noël Monette;Yves Deville;Pierre Dupont
Affiliations:
Department of Computing Sciences and Engineering, Université catholique de Louvain,;Department of Computing Sciences and Engineering, Université catholique de Louvain,;Department of Computing Sciences and Engineering, Université catholique de Louvain,
Venue:
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2007

Citing 8
Cited 0

An algorithm for solving the job-shop problem

Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
Improved CLP scheduling with task intervals

Proceedings of the eleventh international conference on Logic programming
Constraint-Based Scheduling

Constraint-Based Scheduling
A Permutation-Based Approach for Solving the Job-ShopProblem

Constraints
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}

Journal of Heuristics
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Better propagation for non-preemptive single-resource constraint problems

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree but they usually do not consider the absolute ordering of the tasks. In this work, we develop a new propagator for the One-Machine Non-Preemptive Problem, the basic constraint for the Open-Shop Problem. This propagator takes this additional information into account allowing, in most cases, a reduction of the search tree. The underlying principle is to use shaving on the positions. Our propagator applies on one machine or one job and its time complexity is in $\mathcal{O}(N^2 \log N)$, where Nis either the number of jobs or machines. Experiments on the Open-Shop Problem show that the propagator adds pruning to state-of-the-art constraint satisfaction techniques to solve this problem.