A minimax job completion-time problem revisited

DOI10.1016/0893-9659(88)90070-5zbMath0647.90050OpenAlexW2064393533MaRDI QIDQ1104851

Moshe Sniedovich

Publication date: 1988

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(88)90070-5

zbMATH Keywords

closed-form solutionminimax job completion-time problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• An algorithm for the CON due-date determination and sequencing problem
• Minimizing the maximum deviation of job completion time about a common due-date