A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

J. J. Yuan; A. F. Yang; Edwin Tai Chiu Cheng

doi:10.1016/S0377-2217(03)00361-8

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

J. J. Yuan, A. F. Yang, Edwin Tai Chiu Cheng

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

15 Citations (Scopus)

Abstract

We consider the single machine, serial batching scheduling problem 1|prec;pj=p;s-batch;rj|Lmax. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.

Original language	English
Pages (from-to)	525-528
Number of pages	4
Journal	European Journal of Operational Research
Volume	158
Issue number	2
DOIs	https://doi.org/10.1016/S0377-2217(03)00361-8
Publication status	Published - 16 Oct 2004

Keywords

Batches
Precedence constraints
Scheduling

ASJC Scopus subject areas

Modelling and Simulation
Management Science and Operations Research
Information Systems and Management

More information

10.1016/S0377-2217(03)00361-8

http://hdl.handle.net/10397/662

Cite this

@article{e410b9a0c5384c02aeb61384f5f7f190,

title = "A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times",

abstract = "We consider the single machine, serial batching scheduling problem 1|prec;pj=p;s-batch;rj|Lmax. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.",

keywords = "Batches, Precedence constraints, Scheduling",

author = "Yuan, {J. J.} and Yang, {A. F.} and Cheng, {Edwin Tai Chiu}",

year = "2004",

month = oct,

day = "16",

doi = "10.1016/S0377-2217(03)00361-8",

language = "English",

volume = "158",

pages = "525--528",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

AU - Yuan, J. J.

AU - Yang, A. F.

AU - Cheng, Edwin Tai Chiu

PY - 2004/10/16

Y1 - 2004/10/16

N2 - We consider the single machine, serial batching scheduling problem 1|prec;pj=p;s-batch;rj|Lmax. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.

AB - We consider the single machine, serial batching scheduling problem 1|prec;pj=p;s-batch;rj|Lmax. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.

KW - Batches

KW - Precedence constraints

KW - Scheduling

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

U2 - 10.1016/S0377-2217(03)00361-8

DO - 10.1016/S0377-2217(03)00361-8

M3 - Journal article

SN - 0377-2217

VL - 158

SP - 525

EP - 528

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this