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

DOI10.1007/S11590-011-0373-4MaRDI QIDQ1926639zbMATH OpenOpenAlexFDO

Authors Baoqiang Fan, Yeping Sun, Rongjun Chen, Guochun Tang

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

number of late jobsoptimality algorithmsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimality proof of the Kise-Ibaraki-Mine algorithm
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
• A note on the optimality proof of the Kise-Ibaraki-Mine algorithm
• The optimal algorithm of a generalized scheduling problem to minimize the number of late jobs
• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates

Cites work

• 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
• Complexity results for single-machine problems with positive finish-start time-lags
• Handbook of applied optimization
• scientific article; zbMATH DE number 846225 (Why is no real title available?)

Cited in

(6)

• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
• Optimality proof of the Kise-Ibaraki-Mine algorithm
• A note on the optimality proof of the Kise-Ibaraki-Mine algorithm
• An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
• The optimal algorithm of a generalized scheduling problem to minimize the number of late jobs
• Another short proof of optimality for the MIN cache replacement algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926639)