An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

Janny M.Y. Leung; Eugene Levner

doi:10.1016/j.orl.2005.07.010

An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

Janny M.Y. Leung
, Eugene Levner

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

29 Scopus citations

Abstract

We consider no-wait production processes, where identical products are processed sequentially on n machines and transported by programmable hoists. We present an O ( n⁵ ) algorithm that determines the minimum number of hoists required for all possible cycle-times; given the number of hoists, it also finds the minimum-time cyclic hoist-schedule.

Original language	English
Pages (from-to)	465-472
Number of pages	8
Journal	Operations Research Letters
Volume	34
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2005.07.010
State	Published - Jul 2006
Externally published	Yes

Bibliographical note

Funding Information:
This research was partially supported by Competitive Earmarked Research Grant 4213/01E from the Hong Kong Research Grants Council.

Funding

This research was partially supported by Competitive Earmarked Research Grant 4213/01E from the Hong Kong Research Grants Council.

Funders
Hong Kong Research Grants Council

Keywords

Cyclic schedules
Hoist-scheduling
PCB manufacturing
Partially-ordered sets
Polynomial algorithms

Access to Document

10.1016/j.orl.2005.07.010

Cite this

@article{2b1af1d07fa341f89632b44ecfeca385,

title = "An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times",

abstract = "We consider no-wait production processes, where identical products are processed sequentially on n machines and transported by programmable hoists. We present an O ( n5 ) algorithm that determines the minimum number of hoists required for all possible cycle-times; given the number of hoists, it also finds the minimum-time cyclic hoist-schedule.",

keywords = "Cyclic schedules, Hoist-scheduling, PCB manufacturing, Partially-ordered sets, Polynomial algorithms",

author = "Leung, \{Janny M.Y.\} and Eugene Levner",

note = "Funding Information: This research was partially supported by Competitive Earmarked Research Grant 4213/01E from the Hong Kong Research Grants Council. ",

year = "2006",

month = jul,

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

language = "אנגלית",

volume = "34",

pages = "465--472",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

AU - Leung, Janny M.Y.

AU - Levner, Eugene

N1 - Funding Information: This research was partially supported by Competitive Earmarked Research Grant 4213/01E from the Hong Kong Research Grants Council.

PY - 2006/7

Y1 - 2006/7

N2 - We consider no-wait production processes, where identical products are processed sequentially on n machines and transported by programmable hoists. We present an O ( n5 ) algorithm that determines the minimum number of hoists required for all possible cycle-times; given the number of hoists, it also finds the minimum-time cyclic hoist-schedule.

AB - We consider no-wait production processes, where identical products are processed sequentially on n machines and transported by programmable hoists. We present an O ( n5 ) algorithm that determines the minimum number of hoists required for all possible cycle-times; given the number of hoists, it also finds the minimum-time cyclic hoist-schedule.

KW - Cyclic schedules

KW - Hoist-scheduling

KW - PCB manufacturing

KW - Partially-ordered sets

KW - Polynomial algorithms

UR - https://www.scopus.com/pages/publications/33646102212

U2 - 10.1016/j.orl.2005.07.010

DO - 10.1016/j.orl.2005.07.010

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33646102212

SN - 0167-6377

VL - 34

SP - 465

EP - 472

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this