A note: A due-window assignment problem on parallel identical machines

G. Mosheiov; A. Sarig

doi:10.1057/jors.2009.179

A note: A due-window assignment problem on parallel identical machines

G. Mosheiov^*, A. Sarig

^*Corresponding author for this work

Business Administration

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

9 Scopus citations

Abstract

We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n⁴)) solution procedure.

Original language	English
Pages (from-to)	238-241
Number of pages	4
Journal	Journal of the Operational Research Society
Volume	62
Issue number	1
DOIs	https://doi.org/10.1057/jors.2009.179
State	Published - Jan 2011

Bibliographical note

Funding Information:
Acknowledgements—The first author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. The paper was supported in past by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

assignment problem
cheduling
due-window
earliness-tardiness
parallel machines

Access to Document

10.1057/jors.2009.179

Cite this

@article{6f289e4c8b5046c2a005366e28fd6df8,

title = "A note: A due-window assignment problem on parallel identical machines",

abstract = "We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure.",

keywords = "assignment problem, cheduling, due-window, earliness-tardiness, parallel machines",

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

note = "Funding Information: Acknowledgements—The first author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. The paper was supported in past by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.",

year = "2011",

month = jan,

doi = "10.1057/jors.2009.179",

language = "אנגלית",

volume = "62",

pages = "238--241",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "1",

}

TY - JOUR

T1 - A note

T2 - A due-window assignment problem on parallel identical machines

AU - Mosheiov, G.

AU - Sarig, A.

N1 - Funding Information: Acknowledgements—The first author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. The paper was supported in past by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

PY - 2011/1

Y1 - 2011/1

N2 - We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure.

AB - We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure.

KW - assignment problem

KW - cheduling

KW - due-window

KW - earliness-tardiness

KW - parallel machines

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

U2 - 10.1057/jors.2009.179

DO - 10.1057/jors.2009.179

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

AN - SCOPUS:78649946412

SN - 0160-5682

VL - 62

SP - 238

EP - 241

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 1

ER -

A note: A due-window assignment problem on parallel identical machines

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this