A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm

DOI10.1007/s11590-011-0373-4zbMath1261.90016OpenAlexW2057402229MaRDI QIDQ1926639

Guochun Tang, Yeping Sun, Baoqiang Fan, Rongjun Chen

Publication date: 28 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0373-4

zbMATH Keywords

single machinenumber of late jobsoptimality algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity results for single-machine problems with positive finish-start time-lags
• A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

This page was built for publication: A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm