A note on the optimality proof of the Kise-Ibaraki-Mine algorithm

DOI10.1287/OPRE.1090.0749MaRDI QIDQ3100485zbMATH OpenOpenAlexFDO

Authors Shanlin Li, Zhi-Long Chen, Guochun Tang

Publication date 24 November 2011

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1090.0749

zbMATH Keywords

algorithmproduction schedulingproof of optimality

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimality proof of the Kise-Ibaraki-Mine algorithm
• A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
• A note on the optimal makespan of a parallel machine scheduling problem

Cited in

(8)

• Optimality proof of the Kise-Ibaraki-Mine algorithm
• A note on ``Coordination of production and distribution planning by P. Chandra and M. L. Fisher
• A note `On a single machine-scheduling problem with separated position and resource effects'
• An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
• A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming

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

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