Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm

DOI10.1007/s11590-012-0480-xzbMath1273.90081MaRDI QIDQ2377225

Hong Yan, Shanlin Li, Maoqin Li

Publication date: 28 June 2013

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

Full work available at URL: https://doi.org/10.1007/s11590-012-0480-x

zbMATH Keywords

algorithm; production scheduling; real-time system; single machine deterministic sequencing

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• An exact method to minimize the number of tardy jobs in single machine scheduling
• 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
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Combinatorial optimization in real-time scheduling: Theory and algorithms