A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

Chi To Ng; Edwin Tai Chiu Cheng; J. J. Yuana

doi:10.1016/S0167-6377(01)00105-5

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

Chi To Ng, Edwin Tai Chiu Cheng, J. J. Yuana

Research output: Journal article publication › Journal article › Academic research › peer-review

15 Citations (Scopus)

Abstract

We consider the single machine, serial batching, maximum lateness scheduling problem with precedence constraints in this paper. The complexity of this problem is reported as open in the literature. We give an O(n2) polynomial-time algorithm for this problem.

Original language	English
Pages (from-to)	66-68
Number of pages	3
Journal	Operations Research Letters
Volume	30
Issue number	1
DOIs	https://doi.org/10.1016/S0167-6377(01)00105-5
Publication status	Published - 1 Feb 2002

Keywords

Batches
Due-dates
Maximum lateness
Scheduling

ASJC Scopus subject areas

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

More information

10.1016/S0167-6377(01)00105-5

Cite this

@article{857a02ed258e419984266eb7d32d790f,

title = "A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints",

abstract = "We consider the single machine, serial batching, maximum lateness scheduling problem with precedence constraints in this paper. The complexity of this problem is reported as open in the literature. We give an O(n2) polynomial-time algorithm for this problem.",

keywords = "Batches, Due-dates, Maximum lateness, Scheduling",

author = "Ng, {Chi To} and Cheng, {Edwin Tai Chiu} and Yuana, {J. J.}",

year = "2002",

month = feb,

day = "1",

doi = "10.1016/S0167-6377(01)00105-5",

language = "English",

volume = "30",

pages = "66--68",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

AU - Ng, Chi To

AU - Cheng, Edwin Tai Chiu

AU - Yuana, J. J.

PY - 2002/2/1

Y1 - 2002/2/1

N2 - We consider the single machine, serial batching, maximum lateness scheduling problem with precedence constraints in this paper. The complexity of this problem is reported as open in the literature. We give an O(n2) polynomial-time algorithm for this problem.

AB - We consider the single machine, serial batching, maximum lateness scheduling problem with precedence constraints in this paper. The complexity of this problem is reported as open in the literature. We give an O(n2) polynomial-time algorithm for this problem.

KW - Batches

KW - Due-dates

KW - Maximum lateness

KW - Scheduling

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

U2 - 10.1016/S0167-6377(01)00105-5

DO - 10.1016/S0167-6377(01)00105-5

M3 - Journal article

SN - 0167-6377

VL - 30

SP - 66

EP - 68

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

ER -

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this