Improved heuristics for the \(n\)-job single-machine weighted tardiness problem

DOI10.1016/S0305-0548(98)00048-3zbMath0932.90017WikidataQ127753686 ScholiaQ127753686MaRDI QIDQ1302708

A. Volgenant, E. Teerhuis

Publication date: 23 November 1999

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

zbMATH Keywords

heuristicsschedulingweighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Improved heuristics for the early/tardy scheduling problem with no idle time ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems ⋮ Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling ⋮ Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning ⋮ Heuristic dispatching rule to maximize TDD and IDD performance ⋮ Single machine scheduling to minimize total weighted tardiness ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem

This page was built for publication: Improved heuristics for the \(n\)-job single-machine weighted tardiness problem