Due-date assignment with asymmetric earliness-tardiness cost

G. Mosheiov

doi:10.1057/palgrave.jors.2601624

Due-date assignment with asymmetric earliness-tardiness cost

G. Mosheiov^*

^*Corresponding author for this work

BA Business Department

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

7 Scopus citations

Abstract

The problem of minimizing the maximal weighted absolute lateness (MWAL) is known to be NP-hard. The due-date assignment part of MWAL for a given sequence has been shown in the literature to be solved on a single machine in O(n ²) time. In this paper, we study a more general version of the problem with asymmetric cost (nonidentical earliness and tardiness weights). We introduce a linear-programming-based O(n) solution for this case. We also extend our proposed solution procedure to other machine settings such as flow-shop and parallel machines.

Original language	English
Pages (from-to)	1222-1224
Number of pages	3
Journal	Journal of the Operational Research Society
Volume	54
Issue number	11
DOIs	https://doi.org/10.1057/palgrave.jors.2601624
State	Published - Nov 2003

Bibliographical note

Funding Information:
Acknowledgments—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
Parallel machines
Scheduling
Single machine

Access to Document

10.1057/palgrave.jors.2601624

Cite this

@article{60e6055ca9584916bb546a53c8e5eb9b,

title = "Due-date assignment with asymmetric earliness-tardiness cost",

abstract = "The problem of minimizing the maximal weighted absolute lateness (MWAL) is known to be NP-hard. The due-date assignment part of MWAL for a given sequence has been shown in the literature to be solved on a single machine in O(n 2) time. In this paper, we study a more general version of the problem with asymmetric cost (nonidentical earliness and tardiness weights). We introduce a linear-programming-based O(n) solution for this case. We also extend our proposed solution procedure to other machine settings such as flow-shop and parallel machines.",

keywords = "Due-date assignment, Parallel machines, Scheduling, Single machine",

author = "G. Mosheiov",

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

year = "2003",

month = nov,

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

language = "אנגלית",

volume = "54",

pages = "1222--1224",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "11",

}

TY - JOUR

T1 - Due-date assignment with asymmetric earliness-tardiness cost

AU - Mosheiov, G.

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

PY - 2003/11

Y1 - 2003/11

N2 - The problem of minimizing the maximal weighted absolute lateness (MWAL) is known to be NP-hard. The due-date assignment part of MWAL for a given sequence has been shown in the literature to be solved on a single machine in O(n 2) time. In this paper, we study a more general version of the problem with asymmetric cost (nonidentical earliness and tardiness weights). We introduce a linear-programming-based O(n) solution for this case. We also extend our proposed solution procedure to other machine settings such as flow-shop and parallel machines.

AB - The problem of minimizing the maximal weighted absolute lateness (MWAL) is known to be NP-hard. The due-date assignment part of MWAL for a given sequence has been shown in the literature to be solved on a single machine in O(n 2) time. In this paper, we study a more general version of the problem with asymmetric cost (nonidentical earliness and tardiness weights). We introduce a linear-programming-based O(n) solution for this case. We also extend our proposed solution procedure to other machine settings such as flow-shop and parallel machines.

KW - Due-date assignment

KW - Parallel machines

KW - Scheduling

KW - Single machine

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

U2 - 10.1057/palgrave.jors.2601624

DO - 10.1057/palgrave.jors.2601624

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

AN - SCOPUS:0242662775

SN - 0160-5682

VL - 54

SP - 1222

EP - 1224

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 11

ER -

Due-date assignment with asymmetric earliness-tardiness cost

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this