Minimizing total completion time and total deviation of job completion times from a restrictive due-date

Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We study a single-machine scheduling problem with the objective of minimizing a linear combination of total job completion times and total deviation of job completion times from a common due-date. The due-date is assumed to be restrictive, i.e., it may be sufficiently small to have an impact on the optimal sequence. When more weight is allocated to total job completion times, the problem is shown to have a polynomial time solution. When more weight is allocated to total completion time deviations from the due-date, the problem is NP-hard in the ordinary sense. For the latter case, we introduce an efficient dynamic programming algorithm, which is shown numerically to perform well in all our tests.

Original languageAmerican English
Pages (from-to)20-33
Number of pages14
JournalEuropean Journal of Operational Research
Volume165
Issue number1
DOIs
StatePublished - 16 Aug 2005

Bibliographical note

Funding Information:
This research was supported by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Deterministic scheduling
  • Dynamic programming
  • Multiple criteria
  • Single machine

Fingerprint

Dive into the research topics of 'Minimizing total completion time and total deviation of job completion times from a restrictive due-date'. Together they form a unique fingerprint.

Cite this