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

Mathematical Programming

Volumn 70, Issue 1, 1995, Pages 173-190

  Hoogeveen, J A ^a   van de Velde, S L ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Lagrangian relaxation; Scheduling; Slack variables

Indexed keywords

DELAY; FLOW SHOP; LAGRANGIAN METHOD; PRECEDENCE CONSTRAINT; RELAXATION METHOD; SINGLE MACHINE;

SCHEDULING;

EID: 0029193149     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01585935     Document Type: Article

References (33)

1. A survey of algorithms for the single machine total weighted tardiness scheduling problem
2. Optimal linear ordering
3. Formulating the single-machine sequencing problem with release dates as a mixed integer program
4. The Lagrangian relaxation method for solving integer programming problems
5. An applications oriented guide to Lagrangian relaxation
6. The complexity of flowshop and jobshop scheduling
7. Lagrangian relaxation and its uses in integer programming
8. Sequencing a one state-variable machine: a solvable case of the traveling salesman problem
9. The traveling-salesman problem and minimum spanning trees
10. The traveling-salesman problem and minimum spanning trees: Part II
11. New lower and upper bounds for scheduling around a small common due date
12. Single-machine job sequencing with treelike precedence ordering and linear delay penalties
13. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness
14. Sequencing jobs to minimize total weighted completion time subject to precedence constraints
15. Sequencing and scheduling: algorithms and complexity
16. Complexity of scheduling under precedence constraints
17. Complexity of machine scheduling problems
18. A Lagrangean based branch-and-bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time
19. A branch and bound algorithm for the total weighted tardiness problem
20. Structure of a simple scheduling polyhedron
21. Single-machine scheduling polyhedra with precedence constraints
22. A survey of Lagrangian techniques for discrete optimization
23. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs
24. Various optimizers for single-stage production
25. A time indexed formulation of non-preemptive single machine scheduling problems
26. Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
27. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
28. Dual decomposition of machine scheduling problems
29. The permutahedron of series-parallel posets