Evaluation of leading heuristics for the single machine tardiness problem

DOI10.1016/S0377-2217(96)00089-6zbMath0929.90039MaRDI QIDQ1278530

Randolph M. Russell, J. Edward Holsenback

Publication date: 27 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

net benefit of relocationsingle machine tardiness problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems ⋮ Single machine group scheduling with family setups to minimize total tardiness ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Sequencing jobs on a single machine: A neural network approach ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ The single-machine total tardiness scheduling problem: review and extensions

Uses Software

• UNIRAN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic for the single machine tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

This page was built for publication: Evaluation of leading heuristics for the single machine tardiness problem