A new lower bounding scheme for the total weighted tardiness problem.

DOI10.1016/S0305-0548(97)00073-7zbMath1042.90569OpenAlexW1977872555MaRDI QIDQ1406617

M. Selim Akturk, Mehmet Bayram Yildirim

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00073-7

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Stochastic scheduling theory in operations research (90B36)

Related Items

Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ A heuristic algorithm to minimize total weighted tardiness on a single machine with release times ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates.

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Technical Note—A Note on the Weighted Tardiness Problem
• Dominance and Decomposition Heuristics for Single Machine Scheduling
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Weighted Tardiness Single Machine Scheduling with Proportional Weights
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness