A due-window assignment problem with position-dependent processing times

G. Mosheiov; A. Sarig

doi:10.1057/palgrave.jors.2602439

A due-window assignment problem with position-dependent processing times

G. Mosheiov^*, A. Sarig

^*Corresponding author for this work

BA Business Department

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

46 Scopus citations

Abstract

We extend a classical single-machine due-window assignment problem to the case of position-dependent processing times. In addition to the standard job scheduling decisions, one has to assign a time interval (due-window), such that jobs completed within this interval are assumed to be on time and not penalized. The cost components are: total earliness, total tardiness and due-window location and size. We introduce an O(n³) solution algorithm, where n is the number of jobs. We also investigate several special cases, and examine numerically the sensitivity of the solution (schedule and due-window) to the different cost parameters.

Original language	English
Pages (from-to)	997-1003
Number of pages	7
Journal	Journal of the Operational Research Society
Volume	59
Issue number	7
DOIs	https://doi.org/10.1057/palgrave.jors.2602439
State	Published - Jul 2008

Bibliographical note

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

Keywords

Due-window
Earliness-tardiness
Position-dependent processing times
Scheduling

Access to Document

10.1057/palgrave.jors.2602439

Cite this

@article{6bd2b91490ac453aaaf2628937dcdcaa,

title = "A due-window assignment problem with position-dependent processing times",

abstract = "We extend a classical single-machine due-window assignment problem to the case of position-dependent processing times. In addition to the standard job scheduling decisions, one has to assign a time interval (due-window), such that jobs completed within this interval are assumed to be on time and not penalized. The cost components are: total earliness, total tardiness and due-window location and size. We introduce an O(n3) solution algorithm, where n is the number of jobs. We also investigate several special cases, and examine numerically the sensitivity of the solution (schedule and due-window) to the different cost parameters.",

keywords = "Due-window, Earliness-tardiness, Position-dependent processing times, Scheduling",

author = "G. Mosheiov and A. Sarig",

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

year = "2008",

month = jul,

doi = "10.1057/palgrave.jors.2602439",

language = "אנגלית",

volume = "59",

pages = "997--1003",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "7",

}

TY - JOUR

T1 - A due-window assignment problem with position-dependent processing times

AU - Mosheiov, G.

AU - Sarig, A.

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

PY - 2008/7

Y1 - 2008/7

N2 - We extend a classical single-machine due-window assignment problem to the case of position-dependent processing times. In addition to the standard job scheduling decisions, one has to assign a time interval (due-window), such that jobs completed within this interval are assumed to be on time and not penalized. The cost components are: total earliness, total tardiness and due-window location and size. We introduce an O(n3) solution algorithm, where n is the number of jobs. We also investigate several special cases, and examine numerically the sensitivity of the solution (schedule and due-window) to the different cost parameters.

AB - We extend a classical single-machine due-window assignment problem to the case of position-dependent processing times. In addition to the standard job scheduling decisions, one has to assign a time interval (due-window), such that jobs completed within this interval are assumed to be on time and not penalized. The cost components are: total earliness, total tardiness and due-window location and size. We introduce an O(n3) solution algorithm, where n is the number of jobs. We also investigate several special cases, and examine numerically the sensitivity of the solution (schedule and due-window) to the different cost parameters.

KW - Due-window

KW - Earliness-tardiness

KW - Position-dependent processing times

KW - Scheduling

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

U2 - 10.1057/palgrave.jors.2602439

DO - 10.1057/palgrave.jors.2602439

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

AN - SCOPUS:44849113738

SN - 0160-5682

VL - 59

SP - 997

EP - 1003

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 7

ER -

A due-window assignment problem with position-dependent processing times

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this