Generalized disjunctive constraint propagation for solving the job shop problem with time lags

Authors:
Christian Artigues;Marie-José/ Huguet;Pierre Lopez
Affiliations:
CNRS/ LAAS/ 7 avenue du colonel Roche, F-31077 Toulouse, France and Université/ de Toulouse/ UPS, INSA, INP, ISAE/ LAAS/ F-31077 Toulouse, France;CNRS/ LAAS/ 7 avenue du colonel Roche, F-31077 Toulouse, France and Université/ de Toulouse/ UPS, INSA, INP, ISAE/ LAAS/ F-31077 Toulouse, France;CNRS/ LAAS/ 7 avenue du colonel Roche, F-31077 Toulouse, France and Université/ de Toulouse/ UPS, INSA, INP, ISAE/ LAAS/ F-31077 Toulouse, France
Venue:
Engineering Applications of Artificial Intelligence
Year:
2011

Citing 12
Cited 2

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Improved CLP scheduling with task intervals

Proceedings of the eleventh international conference on Logic programming
Insertion techniques for the heuristic solution of the job shop problem

Proceedings of the workshop on Discrete algorithms
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

Proceedings of the third international conference on Graphs and optimization
Backtracking algorithms for disjunctions of temporal constraints

Artificial Intelligence
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Scheduling and constraint propagation

Discrete Applied Mathematics
A lower bound for the job insertion problem

Discrete Applied Mathematics
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

INFORMS Journal on Computing
A memetic algorithm for the job-shop with time-lags

Computers and Operations Research
Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems

Engineering Applications of Artificial Intelligence
One-machine generalized precedence constrained scheduling problems

Operations Research Letters

Models and strategies for variants of the job shop scheduling problem

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the job-shop scheduling problem with time-lags. We propose an insertion heuristic and generalized resource constraint propagation mechanisms. Our propositions are embedded in a branch-and-bound algorithm to provide an experimental evaluation on some benchmark instances. The results obtained conclude that our heuristic achieves the best solutions on the instances, especially when problems involve tightened time lags. The results also prove the interest of the constraint propagation generalization when time lags are considered.