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

Université de technologie de Troyes
Hefei University of Technology

科研成果: 期刊稿件 › 文章 › 同行评审

28 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	274-284
页数	11
期刊	Operations Research Letters
卷	33
期	3
DOI	https://doi.org/10.1016/j.orl.2003.10.012
出版状态	已出版 - 5月 2005
已对外发布	是

访问文件

10.1016/j.orl.2003.10.012

其它文件与链接

链接到 Scopus 的出版物

引用此

@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 - https://www.scopus.com/pages/publications/10044233768

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

摘要

访问文件

其它文件与链接

指纹

引用此