Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
From MaRDI portal
Publication:1906070
zbMath0844.90070MaRDI QIDQ1906070
Steef L. van de Velde, Hoogeveen, J. A.
Publication date: 6 February 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Lagrangian relaxationmachine schedulingprecedence constraintstotal weighted completion timetwo-machine flow-shop\({\mathcal N} {\mathcal P}\)-hard combinatorial optimizationLagrangian bounds
Related Items
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ Flow shop non-idle scheduling and resource-constrained scheduling ⋮ The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ Lower bounds for minimizing total completion time in a two-machine flow shop ⋮ Formulating a scheduling problem with almost identical jobs by using positional completion times ⋮ A new lower bounding scheme for the total weighted tardiness problem. ⋮ Minimizing total completion time in a two-machine flowshop: Analysis of special cases ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints ⋮ An improved branch-and-bound algorithm for the two machine total completion time flow shop problem ⋮ An exact algorithm for the precedence-constrained single-machine scheduling problem ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
