Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
From MaRDI portal
Publication:875408
DOI10.1016/J.COR.2005.10.006zbMath1141.90567OpenAlexW2064703887MaRDI QIDQ875408
Hua Xuan, Jiyin Liu, Lixin Tang
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.006
Lagrangian relaxationsingle machine schedulingweighted tardinessprecedence constrainthybrid backward and forward dynamic programming
Related Items (7)
A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem ⋮ Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ An exact algorithm for the precedence-constrained single-machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
