Corpus ID: 16410562

Polyhedral Approaches to Machine Scheduling

  title={Polyhedral Approaches to Machine Scheduling},
  author={M. Queyranne and Andreas S. Schulz},
  • M. Queyranne, Andreas S. Schulz
  • Published 2008
  • Computer Science
  • We provide a review and synthesis of polyhedral approaches to machine scheduling problems. The choice of decision variables is the prime determinant of various formulations for such problems. Constraints, such as facet inducing inequalities for corresponding polyhedra, are often needed, in addition to those just required for the validity of the initial formulation, in order to obtain useful lower bounds and structural insights. We review formulations based on time–indexed variables; on linear… CONTINUE READING
    113 Citations
    On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
    • 3
    • PDF
    A family of inequalities valid for the robust single machine scheduling polyhedron
    • 23
    On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
    • 44
    • PDF
    Dual relaxations of the time-indexed ILP formulation for min–sum scheduling problems
    • 1
    Scheduling two chains of unit jobs on one machine: A polyhedral study
    • 4
    • PDF
    Decomposition Algorithm for the Single Machine Scheduling Polytope
    • 4
    • PDF


    A polyhedral approach to the delivery man problem
    • 50
    • PDF
    On the facial structure of scheduling polyhedra
    • 110
    Single-Machine Scheduling Polyhedra with Precedence Constraints
    • 83
    Scheduling to minimize average completion time: off-line and on-line algorithms
    • 240
    Formulating the single machine sequencing problem with release dates as a mixed integer program
    • 244
    • PDF
    Parallel Machine Scheduling by Column Generation
    • 136
    • PDF
    A Computational Study of the Job-Shop Scheduling Problem
    • 830