Two due date assignment problems in scheduling a single machine

Dvir Shabtay; George Steiner

doi:10.1016/j.orl.2005.10.009

Two due date assignment problems in scheduling a single machine

Dvir Shabtay
, George Steiner

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

54 Scopus citations

Abstract

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases.

Original language	English
Pages (from-to)	683-691
Number of pages	9
Journal	Operations Research Letters
Volume	34
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2005.10.009
State	Published - 1 Nov 2006
Externally published	Yes

Keywords

Due date assignment
Single-machine scheduling

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2005.10.009

Cite this

@article{693090350f0e490087963081761c35af,

title = "Two due date assignment problems in scheduling a single machine",

abstract = "We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases.",

keywords = "Due date assignment, Single-machine scheduling",

author = "Dvir Shabtay and George Steiner",

year = "2006",

month = nov,

day = "1",

doi = "10.1016/j.orl.2005.10.009",

language = "English",

volume = "34",

pages = "683--691",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Two due date assignment problems in scheduling a single machine

AU - Shabtay, Dvir

AU - Steiner, George

PY - 2006/11/1

Y1 - 2006/11/1

N2 - We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases.

AB - We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases.

KW - Due date assignment

KW - Single-machine scheduling

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

U2 - 10.1016/j.orl.2005.10.009

DO - 10.1016/j.orl.2005.10.009

M3 - Article

AN - SCOPUS:33747147410

SN - 0167-6377

VL - 34

SP - 683

EP - 691

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

Two due date assignment problems in scheduling a single machine

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this