Parallel machine scheduling with precedence constraints and setup times

  • Gacias B
  • Artigues C
  • Lopez P
  • 1


    Mendeley users who have this article in their library.
  • 25


    Citations of this article.


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. © 2010 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Branch-and-bound
  • Dominance conditions
  • Limited discrepancy search
  • Local search
  • Parallel machine scheduling
  • Precedence constraints
  • Setup times

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Bernat Gacias

  • Christian Artigues

  • Pierre Lopez

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free