Average and worst-case analysis of heuristics for the maximum tardiness problem

DOI10.1016/0377-2217(86)90190-6zbMath0599.90054OpenAlexW1984847202MaRDI QIDQ1080771

Nicholas G. Hall, WanSoo T. Rhee

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90190-6

zbMATH Keywords

heuristic approachessingle processoraverage errorknown ready times, processing times and due datesmaximum tardiness problemNonparametric statistical testsworst-case performance bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Unnamed Item
• A decision-theoretic framework for comparing heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Worst-Case Analysis of Heuristic Algorithms
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Sequencing with due-dates and early start times to minimize maximum tardiness
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Average and worst-case analysis of heuristics for the maximum tardiness problem