Parallel machine scheduling with precedence constraints and setup times

Authors:
Bernat Gacias;Christian Artigues;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:
Computers and Operations Research
Year:
2010

Citing 14
Cited 5

New benchmark results for the resource-constrained project scheduling problem

Management Science
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Solving Parallel Machine Scheduling Problems by Column Generation

INFORMS Journal on Computing
RanGen: A Random Network Generator for Activity-on-the-Node Networks

Journal of Scheduling
Earliness-tardiness scheduling with setup considerations

Computers and Operations Research
An exact method for Pm/sds,ri/Σi=1nCi problem

Computers and Operations Research
Search tree based approaches for parallel machine scheduling

Computers and Operations Research
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times

Computers and Operations Research
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Improved limited discrepancy search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
List scheduling revisited

Operations Research Letters
List scheduling in a parallel machine environment with precedence constraints and setup times

Operations Research Letters

Discrepancy search for the flexible job shop scheduling problem

Computers and Operations Research
Scheduler-oriented algorithms to improve human-machine cooperation in transportation scheduling support systems

Engineering Applications of Artificial Intelligence
A GRASP approach to transporter scheduling and routing at a shipyard

Computers and Industrial Engineering
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

Journal of Mathematical Modelling and Algorithms
Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. These problems are strongly NP-hard and it is even conjectured that no list scheduling algorithm can be defined without explicitly considering jointly scheduling and resource allocation. We propose dominance conditions based on the analysis of the problem structure and an extension to setup times of the energetic reasoning constraint propagation algorithm. An exact branch-and-bound procedure and a climbing discrepancy search (CDS) heuristic based on these components are defined. We show how the proposed dominance rules can still be valid in the CDS scheme. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from the literature and those obtained with an efficient commercial solver. We conclude that our propositions are quite competitive and our results even outperform other approaches in most cases.