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

Maoqin Li, Shanlin Li, Hong Yan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

Abstract

Kise et al. (Oper. Res. 26:121-126, 1978) give an O(n2) 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 et al. (Oper. Res. 58:508-509, 2010a) point out that their proof of optimality for their algorithm is incorrect by giving a counter-example. In this paper, using the concept of "tower-of-sets" from Lawler (Math. Comput. Model. 20:91-106, 1994), we construct the tower-of-sets of the early job set generated by the algorithm. Then we give a correct proof of optimality for the algorithm and show a new result that the early job set by the algorithm obtains not only the maximum number of jobs but also the smallest total processing time among all optimal schedules. The result can be applied to study the problems of the hard real-time systems.
Original languageEnglish
Pages (from-to)1017-1026
Number of pages10
JournalOptimization Letters
Volume7
Issue number5
DOIs
Publication statusPublished - 1 Jun 2013

Keywords

  • Algorithm
  • Production scheduling
  • Real-time system
  • Single machine deterministic sequencing

ASJC Scopus subject areas

  • Control and Optimization

Cite this