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

Lagrangian relaxation is a powerful bounding technique that has been applied successfully to manyNP-hard combinatorial optimization problems. The basic idea is to see anNP-hard problem as an “easy-to-solve” problem complicated by a number of “nasty” side constraints. We show that reformulating nasty inequality constraints as equalities by using slack variables leads to stronger lower bounds. The trick is widely applicable, but we focus on a broad class of machine scheduling problems for which it is particularly useful. We provide promising computational results for three problems belonging to this class for which Lagrangian bounds have appeared in the literature: the single-machine problem of minimizing total weighted completion time subject to precedence constraints, the two-machine flow-shop problem of minimizing total completion time, and the single-machine problem of minimizing total weighted tardiness.

[1]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[2]  J. Shapiro.  A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .

[3]  S. L. van de Velde,et al.  Machine scheduling and Lagrangian relaxation , 1991 .

[4]  Steef L. van de Velde.  Dual decomposition of a single-machine scheduling problem , 1995, Math. Program..

[5]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[6]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

[7]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[8]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[9]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[10]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[11]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[12]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[13]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[14]  Han Hoogeveen,et al.  New Lower and Upper Bounds for Scheduling Around a Small Common Due Date , 1994, Oper. Res..

[15]  Andreas S. Schulz.  The Permutahedron of Series-parallel Posets , 1995, Discret. Appl. Math..

[16]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[17]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[18]  Paolo Toth,et al.  Algorithms and computer implementations , 1990 .

[19]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[20]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[21]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[22]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[23]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[24]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[25]  Rainer Schrader,et al.  The permutahedron of series-parallel posets , 1990, Discret. Appl. Math..

[26]  Gerard Sierksma,et al.  Small and large TSP: Two polynomially solvable cases of the traveling salesman problem , 1993 .

[27]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[28]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[29]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[30]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[31]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[32]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[33]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[34]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[35]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..