Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties

Research output: Journal article publicationJournal articleAcademic researchpeer-review

38 Citations (Scopus)


The paper considers the problem of scheduling n independent and simultaneously available jobs on a single machine, where the job processing times are compressible as a linear cost function. The objective is to find an optimal permutation of the jobs, an optimal due date and the optimal processing times which jointly minimize a cost function consisting of the earliness, tardiness, completion time and compressing costs. It shows that the problem can be solved as an assignment problem.
Original languageEnglish
Pages (from-to)329-336
Number of pages8
JournalEngineering Optimization
Issue number1-3
Publication statusPublished - 1 Dec 1999


  • Controllable processing times
  • Earliness/tardiness penalties
  • Scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Engineering (miscellaneous)

Cite this