Optimality proof of the Kise---Ibaraki---Mine algorithm

Authors:
Shanlin Li;Zhi-Long Chen;Guochun Tang
Affiliations:
Department of Mathematics, Taizhou University, Taizhou, P.R. China 317000;Robert H. Smith School of Business, University of Maryland, College Park, USA 20742;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, P.R. China 201209
Venue:
Journal of Scheduling
Year:
2012

Citing 5
Cited 0

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

Journal of Scheduling
A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm

Operations Research
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property

Mathematical and Computer Modelling: An International Journal
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Kise, Ibaraki and Mine (Operations Research 26:121---126, 1978) give an O(n 2) time algorithm to find an optimal schedule for the single-machine number of late jobs problem with agreeable job release dates and due dates. Li, Chen and Tang (Operations Research 58:508---509, 2010) point out that their proof of optimality for their algorithm is incorrect by giving a counter-example. In this paper we give a correct proof of optimality for their algorithm.