Minimizing the number of late jobs when the start time of the machine is variable

Han Hoogeveen; Vincent T'Kindt

doi:10.1016/j.orl.2012.05.006

Minimizing the number of late jobs when the start time of the machine is variable

Han Hoogeveen^*, Vincent T'Kindt

^*Corresponding author for this work

Université de Tours

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

Abstract

We consider the bicriteria single-machine scheduling problem of minimizing the number of tardy jobs and the cost of starting the machine at time -A. We show that we can find all Pareto optimal points by considering at most O( ⁿ²) values of A, where for a given A value, we use an SPT-based algorithm to find the optimal solution instead of Moore-Hodgson.

Original language	English
Pages (from-to)	353-355
Number of pages	3
Journal	Operations Research Letters
Volume	40
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2012.05.006
Publication status	Published - Sept 2012

Keywords

ε-constraint approach
Number of late jobs
Pareto optimal points
Single machine scheduling

Access to Document

10.1016/j.orl.2012.05.006

Cite this

@article{a81933f0809d4f59837ac41dca416443,

title = "Minimizing the number of late jobs when the start time of the machine is variable",

abstract = "We consider the bicriteria single-machine scheduling problem of minimizing the number of tardy jobs and the cost of starting the machine at time -A. We show that we can find all Pareto optimal points by considering at most O( n2) values of A, where for a given A value, we use an SPT-based algorithm to find the optimal solution instead of Moore-Hodgson.",

keywords = "ε-constraint approach, Number of late jobs, Pareto optimal points, Single machine scheduling",

author = "Han Hoogeveen and Vincent T'Kindt",

year = "2012",

month = sep,

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

language = "English",

volume = "40",

pages = "353--355",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Minimizing the number of late jobs when the start time of the machine is variable

AU - Hoogeveen, Han

AU - T'Kindt, Vincent

PY - 2012/9

Y1 - 2012/9

N2 - We consider the bicriteria single-machine scheduling problem of minimizing the number of tardy jobs and the cost of starting the machine at time -A. We show that we can find all Pareto optimal points by considering at most O( n2) values of A, where for a given A value, we use an SPT-based algorithm to find the optimal solution instead of Moore-Hodgson.

AB - We consider the bicriteria single-machine scheduling problem of minimizing the number of tardy jobs and the cost of starting the machine at time -A. We show that we can find all Pareto optimal points by considering at most O( n2) values of A, where for a given A value, we use an SPT-based algorithm to find the optimal solution instead of Moore-Hodgson.

KW - ε-constraint approach

KW - Number of late jobs

KW - Pareto optimal points

KW - Single machine scheduling

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

U2 - 10.1016/j.orl.2012.05.006

DO - 10.1016/j.orl.2012.05.006

M3 - Article

AN - SCOPUS:84864462723

SN - 0167-6377

VL - 40

SP - 353

EP - 355

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Minimizing the number of late jobs when the start time of the machine is variable

Abstract

Keywords

Access to Document

Fingerprint

Cite this