A note on pre-emptive scheduling with earliness and tardiness costs

Gur Mosheiov

doi:10.1080/09537289608930368

A note on pre-emptive scheduling with earliness and tardiness costs

Gur Mosheiov

Business Administration

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

2 Scopus citations

Abstract

The option of pre-emption seems to have escaped the attention of existing literature on scheduling problems with earliness and tardiness costs. This note presents an attempt to accommodate pre-emption in such settings. The focus is on models with a common due date for all jobs under different cost structures (job dependent versus job independent), and different objectives (minsum and minmax). It appears that only one of these cases is not polynomially solvable: the case of minsum objective and job-dependent (linear) cost. An exact dynamic programming algorithm is introduced for this problem, as well as an efficient heuristic, which is shown to perform extremely well in our numerical tests.

Original language	English
Pages (from-to)	401-406
Number of pages	6
Journal	Production Planning and Control
Volume	7
Issue number	4
DOIs	https://doi.org/10.1080/09537289608930368
State	Published - 1996

Bibliographical note

Funding Information:
I would like to thank Avital Lann and Aliza Schachter for their helpful comments. This paper was partially supported by The Israel Foundation Trustees.

Keywords

Deterministic scheduling
Earliness and tardiness costs
Heuristics
Pre-emption

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1080/09537289608930368

Cite this

@article{c35820ce1b964e52a1c2af9c88ee03d3,

title = "A note on pre-emptive scheduling with earliness and tardiness costs",

abstract = "The option of pre-emption seems to have escaped the attention of existing literature on scheduling problems with earliness and tardiness costs. This note presents an attempt to accommodate pre-emption in such settings. The focus is on models with a common due date for all jobs under different cost structures (job dependent versus job independent), and different objectives (minsum and minmax). It appears that only one of these cases is not polynomially solvable: the case of minsum objective and job-dependent (linear) cost. An exact dynamic programming algorithm is introduced for this problem, as well as an efficient heuristic, which is shown to perform extremely well in our numerical tests.",

keywords = "Deterministic scheduling, Earliness and tardiness costs, Heuristics, Pre-emption",

author = "Gur Mosheiov",

note = "Funding Information: I would like to thank Avital Lann and Aliza Schachter for their helpful comments. This paper was partially supported by The Israel Foundation Trustees.",

year = "1996",

doi = "10.1080/09537289608930368",

language = "אנגלית",

volume = "7",

pages = "401--406",

journal = "Production Planning and Control",

issn = "0953-7287",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - A note on pre-emptive scheduling with earliness and tardiness costs

AU - Mosheiov, Gur

N1 - Funding Information: I would like to thank Avital Lann and Aliza Schachter for their helpful comments. This paper was partially supported by The Israel Foundation Trustees.

PY - 1996

Y1 - 1996

N2 - The option of pre-emption seems to have escaped the attention of existing literature on scheduling problems with earliness and tardiness costs. This note presents an attempt to accommodate pre-emption in such settings. The focus is on models with a common due date for all jobs under different cost structures (job dependent versus job independent), and different objectives (minsum and minmax). It appears that only one of these cases is not polynomially solvable: the case of minsum objective and job-dependent (linear) cost. An exact dynamic programming algorithm is introduced for this problem, as well as an efficient heuristic, which is shown to perform extremely well in our numerical tests.

AB - The option of pre-emption seems to have escaped the attention of existing literature on scheduling problems with earliness and tardiness costs. This note presents an attempt to accommodate pre-emption in such settings. The focus is on models with a common due date for all jobs under different cost structures (job dependent versus job independent), and different objectives (minsum and minmax). It appears that only one of these cases is not polynomially solvable: the case of minsum objective and job-dependent (linear) cost. An exact dynamic programming algorithm is introduced for this problem, as well as an efficient heuristic, which is shown to perform extremely well in our numerical tests.

KW - Deterministic scheduling

KW - Earliness and tardiness costs

KW - Heuristics

KW - Pre-emption

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

U2 - 10.1080/09537289608930368

DO - 10.1080/09537289608930368

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

AN - SCOPUS:0030193224

SN - 0953-7287

VL - 7

SP - 401

EP - 406

JO - Production Planning and Control

JF - Production Planning and Control

IS - 4

ER -

A note on pre-emptive scheduling with earliness and tardiness costs

Abstract

Bibliographical note

Keywords

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this