An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs

Enrique Gerstl; Gur Mosheiov

doi:10.1016/j.ipl.2013.06.013

An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs

Enrique Gerstl^*
, Gur Mosheiov

^*Corresponding author for this work

BA Business Department

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

6 Scopus citations

Abstract

We study a due-window assignment problem on parallel identical machines, with unit processing time jobs. The objective function is minimum total cost, consisting of earliness, tardiness, due-window starting time and due-window size. A recent paper (Janiak et al., 2012) introduced a solution algorithm requiring O(ⁿ⁵/^m2) time, where n is the number of jobs, and m is the number of machines. We propose a significantly faster procedure, requiring O(ⁿ³) only.

Original language	English
Pages (from-to)	754-759
Number of pages	6
Journal	Information Processing Letters
Volume	113
Issue number	19-21
DOIs	https://doi.org/10.1016/j.ipl.2013.06.013
State	Published - 2013

Bibliographical note

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

Keywords

Assignment problem
Due-window
Earliness-tardiness
Parallel machines
Scheduling

Access to Document

10.1016/j.ipl.2013.06.013

Cite this

@article{26e4578b894045a699e53355ac231366,

title = "An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs",

abstract = "We study a due-window assignment problem on parallel identical machines, with unit processing time jobs. The objective function is minimum total cost, consisting of earliness, tardiness, due-window starting time and due-window size. A recent paper (Janiak et al., 2012) introduced a solution algorithm requiring O(n5/m2) time, where n is the number of jobs, and m is the number of machines. We propose a significantly faster procedure, requiring O(n3) only.",

keywords = "Assignment problem, Due-window, Earliness-tardiness, Parallel machines, Scheduling",

author = "Enrique Gerstl and Gur Mosheiov",

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

year = "2013",

doi = "10.1016/j.ipl.2013.06.013",

language = "אנגלית",

volume = "113",

pages = "754--759",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "19-21",

}

TY - JOUR

T1 - An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs

AU - Gerstl, Enrique

AU - Mosheiov, Gur

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

PY - 2013

Y1 - 2013

N2 - We study a due-window assignment problem on parallel identical machines, with unit processing time jobs. The objective function is minimum total cost, consisting of earliness, tardiness, due-window starting time and due-window size. A recent paper (Janiak et al., 2012) introduced a solution algorithm requiring O(n5/m2) time, where n is the number of jobs, and m is the number of machines. We propose a significantly faster procedure, requiring O(n3) only.

AB - We study a due-window assignment problem on parallel identical machines, with unit processing time jobs. The objective function is minimum total cost, consisting of earliness, tardiness, due-window starting time and due-window size. A recent paper (Janiak et al., 2012) introduced a solution algorithm requiring O(n5/m2) time, where n is the number of jobs, and m is the number of machines. We propose a significantly faster procedure, requiring O(n3) only.

KW - Assignment problem

KW - Due-window

KW - Earliness-tardiness

KW - Parallel machines

KW - Scheduling

UR - https://www.scopus.com/pages/publications/84880941784

U2 - 10.1016/j.ipl.2013.06.013

DO - 10.1016/j.ipl.2013.06.013

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

AN - SCOPUS:84880941784

SN - 0020-0190

VL - 113

SP - 754

EP - 759

JO - Information Processing Letters

JF - Information Processing Letters

IS - 19-21

ER -

An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this