A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

Ada Che; Chengbin Chu

doi:10.1016/j.orl.2003.10.012

A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

Ada Che, Chengbin Chu

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

28 Scopus citations

Abstract

This paper addresses cyclic hoist scheduling in a no-wait electroplating line where a part visits some processing tanks more than once and multiple duplicate tanks are used at some production stages. We prove that such an extended problem can be solved in polynomial time.

Original language	English
Pages (from-to)	274-284
Number of pages	11
Journal	Operations Research Letters
Volume	33
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2003.10.012
State	Published - May 2005
Externally published	Yes

Keywords

Cyclic scheduling
Hoist scheduling
No-wait
Polynomial algorithm

Access to Document

10.1016/j.orl.2003.10.012

Cite this

@article{a44d544b3cdf4c07a7441f4fe875f2c4,

title = "A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line",

abstract = "This paper addresses cyclic hoist scheduling in a no-wait electroplating line where a part visits some processing tanks more than once and multiple duplicate tanks are used at some production stages. We prove that such an extended problem can be solved in polynomial time.",

keywords = "Cyclic scheduling, Hoist scheduling, No-wait, Polynomial algorithm",

author = "Ada Che and Chengbin Chu",

year = "2005",

month = may,

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

language = "英语",

volume = "33",

pages = "274--284",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

AU - Che, Ada

AU - Chu, Chengbin

PY - 2005/5

Y1 - 2005/5

N2 - This paper addresses cyclic hoist scheduling in a no-wait electroplating line where a part visits some processing tanks more than once and multiple duplicate tanks are used at some production stages. We prove that such an extended problem can be solved in polynomial time.

AB - This paper addresses cyclic hoist scheduling in a no-wait electroplating line where a part visits some processing tanks more than once and multiple duplicate tanks are used at some production stages. We prove that such an extended problem can be solved in polynomial time.

KW - Cyclic scheduling

KW - Hoist scheduling

KW - No-wait

KW - Polynomial algorithm

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

U2 - 10.1016/j.orl.2003.10.012

DO - 10.1016/j.orl.2003.10.012

M3 - 文章

AN - SCOPUS:10044233768

SN - 0167-6377

VL - 33

SP - 274

EP - 284

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this