On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

Chi To Ng; Edwin Tai Chiu Cheng; J. J. Yuan; Z. H. Liu

doi:10.1016/S0167-6377(03)00007-5

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

Chi To Ng, Edwin Tai Chiu Cheng, J. J. Yuan, Z. H. Liu

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

24 Citations (Scopus)

Abstract

We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as open in the literature. We provide an O(n5) time algorithm to solve this problem.

Original language	English
Pages (from-to)	323-326
Number of pages	4
Journal	Operations Research Letters
Volume	31
Issue number	4
DOIs	https://doi.org/10.1016/S0167-6377(03)00007-5
Publication status	Published - 1 Jul 2003

Keywords

Batches
Precedence constraints
Scheduling

ASJC Scopus subject areas

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

More information

10.1016/S0167-6377(03)00007-5

Cite this

@article{ec46c5a4e0184447a0d48f14be2070a3,

title = "On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times",

abstract = "We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as open in the literature. We provide an O(n5) time algorithm to solve this problem.",

keywords = "Batches, Precedence constraints, Scheduling",

author = "Ng, {Chi To} and Cheng, {Edwin Tai Chiu} and Yuan, {J. J.} and Liu, {Z. H.}",

year = "2003",

month = jul,

day = "1",

doi = "10.1016/S0167-6377(03)00007-5",

language = "English",

volume = "31",

pages = "323--326",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. / Ng, Chi To ; Cheng, Edwin Tai Chiu; Yuan, J. J. et al.
In: Operations Research Letters, Vol. 31, No. 4, 01.07.2003, p. 323-326.

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

TY - JOUR

T1 - On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

AU - Ng, Chi To

AU - Cheng, Edwin Tai Chiu

AU - Yuan, J. J.

AU - Liu, Z. H.

PY - 2003/7/1

Y1 - 2003/7/1

N2 - We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as open in the literature. We provide an O(n5) time algorithm to solve this problem.

AB - We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as open in the literature. We provide an O(n5) time algorithm to solve this problem.

KW - Batches

KW - Precedence constraints

KW - Scheduling

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

U2 - 10.1016/S0167-6377(03)00007-5

DO - 10.1016/S0167-6377(03)00007-5

M3 - Journal article

SN - 0167-6377

VL - 31

SP - 323

EP - 326

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this