Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Yong He, Qi Wei, Edwin Tai Chiu Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

6 Citations (Scopus)

Abstract

We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time algorithm. Furthermore, we extend the problem to the case of discrete controllable processing times, where the processing time of a job can only take one of several given discrete values. We show that even some special cases of the discrete controllable version with the objective of minimizing the total compression cost are NP-hard, but the general case is solvable in pseudo-polynomial time. Moreover, we present a strongly polynomial time algorithm to construct the trade-off curve between the number of tardy jobs and the maximum compression cost for the discrete controllable version.
Original languageEnglish
Pages (from-to)303-310
Number of pages8
JournalJournal of Scheduling
Volume10
Issue number4-5
DOIs
Publication statusPublished - 1 Oct 2007

Keywords

  • Controllable processing times
  • Pseudo-polynomial time algorithm
  • Single-machine scheduling problem
  • Strongly polynomial time algorithm

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Cite this