Scheduling identical jobs and due-window on uniform machines

Gur Mosheiov; Assaf Sarig

doi:10.1016/j.ejor.2009.03.039

Scheduling identical jobs and due-window on uniform machines

Gur Mosheiov^*, Assaf Sarig

^*Corresponding author for this work

Business Administration

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

17 Scopus citations

Abstract

We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced.

Original language	English
Pages (from-to)	712-719
Number of pages	8
Journal	European Journal of Operational Research
Volume	201
Issue number	3
DOIs	https://doi.org/10.1016/j.ejor.2009.03.039
State	Published - 16 Mar 2010

Bibliographical note

Funding Information:
We thank two anonymous referees for their very valuable comments. 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
Scheduling
Tardiness
Uniform machines

Access to Document

10.1016/j.ejor.2009.03.039

Cite this

@article{77b02adb4e444338b9c5a3b7626630a9,

title = "Scheduling identical jobs and due-window on uniform machines",

abstract = "We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced.",

keywords = "Due-window, Earliness, Scheduling, Tardiness, Uniform machines",

author = "Gur Mosheiov and Assaf Sarig",

note = "Funding Information: We thank two anonymous referees for their very valuable comments. This paper was supported in part by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.",

year = "2010",

month = mar,

day = "16",

doi = "10.1016/j.ejor.2009.03.039",

language = "אנגלית",

volume = "201",

pages = "712--719",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Scheduling identical jobs and due-window on uniform machines

AU - Mosheiov, Gur

AU - Sarig, Assaf

N1 - Funding Information: We thank two anonymous referees for their very valuable comments. This paper was supported in part by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

PY - 2010/3/16

Y1 - 2010/3/16

N2 - We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced.

AB - We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced.

KW - Due-window

KW - Earliness

KW - Scheduling

KW - Tardiness

KW - Uniform machines

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

U2 - 10.1016/j.ejor.2009.03.039

DO - 10.1016/j.ejor.2009.03.039

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

AN - SCOPUS:70349459534

SN - 0377-2217

VL - 201

SP - 712

EP - 719

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Scheduling identical jobs and due-window on uniform machines

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this