Dual decomposition of a single-machine scheduling problem

DOI10.1016/0025-5610(94)00085-8zbMath0845.90076OpenAlexW4242695443MaRDI QIDQ1906279

Steef L. van de Velde

Publication date: 12 February 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5610(94)00085-8

zbMATH Keywords

Lagrangian relaxationsingle-machine schedulingprecedence constraintsdual decompositiontotal weighted completion timeLagrangian dual problemascent direction algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Formulating a scheduling problem with almost identical jobs by using positional completion times ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ An exact algorithm for the precedence-constrained single-machine scheduling problem

This page was built for publication: Dual decomposition of a single-machine scheduling problem