Due-date assignment and maintenance activity scheduling problem

Gur Mosheiov*, Daniel Oron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

61 Scopus citations

Abstract

In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent factor. The objective is minimum total earliness, tardiness and due-date cost. We introduce a polynomial (O (n4)) solution for the problem.

Original languageAmerican English
Pages (from-to)1053-1057
Number of pages5
JournalMathematical and Computer Modelling
Volume44
Issue number11-12
DOIs
StatePublished - Dec 2006

Bibliographical note

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

Keywords

  • Due-date assignment
  • Earliness-tardiness
  • Rate modifying activity
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'Due-date assignment and maintenance activity scheduling problem'. Together they form a unique fingerprint.

Cite this