Due-date assignment and maintenance activity scheduling problem

Gur Mosheiov; Daniel Oron

doi:10.1016/j.mcm.2006.03.008

Due-date assignment and maintenance activity scheduling problem

Gur Mosheiov^*, Daniel Oron

^*Corresponding author for this work

Business Administration

Research output: Contribution to journal › Article › peer-review

62 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 (n⁴)) solution for the problem.

Original language	English
Pages (from-to)	1053-1057
Number of pages	5
Journal	Mathematical and Computer Modelling
Volume	44
Issue number	11-12
DOIs	https://doi.org/10.1016/j.mcm.2006.03.008
State	Published - 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

Access to Document

10.1016/j.mcm.2006.03.008

Cite this

@article{a8ec2f2e08c6426ba7599fa8a36559f4,

title = "Due-date assignment and maintenance activity scheduling problem",

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.",

keywords = "Due-date assignment, Earliness-tardiness, Rate modifying activity, Scheduling, Single machine",

author = "Gur Mosheiov and Daniel Oron",

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

year = "2006",

month = dec,

doi = "10.1016/j.mcm.2006.03.008",

language = "אנגלית",

volume = "44",

pages = "1053--1057",

journal = "Mathematical and Computer Modelling",

issn = "0895-7177",

publisher = "Elsevier Ltd.",

number = "11-12",

}

TY - JOUR

T1 - Due-date assignment and maintenance activity scheduling problem

AU - Mosheiov, Gur

AU - Oron, Daniel

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

PY - 2006/12

Y1 - 2006/12

N2 - 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.

AB - 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.

KW - Due-date assignment

KW - Earliness-tardiness

KW - Rate modifying activity

KW - Scheduling

KW - Single machine

UR - http://www.scopus.com/inward/record.url?scp=33746924022&partnerID=8YFLogxK

U2 - 10.1016/j.mcm.2006.03.008

DO - 10.1016/j.mcm.2006.03.008

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33746924022

SN - 0895-7177

VL - 44

SP - 1053

EP - 1057

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

IS - 11-12

ER -

Due-date assignment and maintenance activity scheduling problem

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this