# Polyhedral Approaches to Machine Scheduling

@inproceedings{Queyranne2008PolyhedralAT, title={Polyhedral Approaches to Machine Scheduling}, author={M. Queyranne and Andreas S. Schulz}, year={2008} }

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

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2006

3- PDF

A family of inequalities valid for the robust single machine scheduling polyhedron

- Mathematics, Computer Science
- Comput. Oper. Res.
- 2010

23

Algorithms over Arc-time Indexed Formulations for Single and Parallel Machine Scheduling Problems

- 2008

8- PDF

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

- Mathematics, Computer Science
- Math. Program.
- 2007

44- PDF

A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness

- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 2017

14

Dominance inequalities for scheduling around an unrestrictive common due date

- Computer Science, Mathematics
- ArXiv
- 2021

- PDF

Dual relaxations of the time-indexed ILP formulation for min–sum scheduling problems

- Mathematics, Computer Science
- Ann. Oper. Res.
- 2017

1

Scheduling two chains of unit jobs on one machine: A polyhedral study

- Mathematics, Computer Science
- Networks
- 2011

4- PDF

Decomposition Algorithm for the Single Machine Scheduling Polytope

- Mathematics, Computer Science
- ISCO
- 2014

4- PDF

#### References

SHOWING 1-10 OF 126 REFERENCES

Single-Machine Scheduling Polyhedra with Precedence Constraints

- Mathematics, Computer Science
- Math. Oper. Res.
- 1991

83

Scheduling to minimize average completion time: off-line and on-line algorithms

- Computer Science, Mathematics
- SODA '96
- 1996

240

Formulating the single machine sequencing problem with release dates as a mixed integer program

- Computer Science, Mathematics
- Discret. Appl. Math.
- 1990

244- PDF

A mixed-integer model for solving ordering problems with side constraints

- Computer Science
- Ann. Oper. Res.
- 1997

25

A Computational Study of the Job-Shop Scheduling Problem

- Computer Science
- INFORMS Journal on Computing
- 1991

830

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

- Mathematics, Computer Science
- Math. Oper. Res.
- 1997

465- PDF

Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems

- Mathematics, Computer Science
- Math. Program.
- 1995

58- PDF