A Heuristic for Inserting Randomly Arriving Jobs into an Existing Hoist Schedule

Pengyu Yan, Ada Che, Eugene Levner, Shi Qiang Liu

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Hoist scheduling in automated electroplating lines has been extensively studied in a static environment. However, practical electroplating lines are subject to diversified unforeseen disruptions that require frequent rescheduling to maintain or optimize system performance. This paper addresses a hoist scheduling problem, where randomly arriving jobs need to be inserted into an existing schedule without changing the sequence of hoist moves already scheduled. The objective is to minimize the total completion time of all the jobs in the existing schedule and a newly inserted job. We develop a polynomial-time heuristic that adjusts the starting times of the existing hoist moves to a limited extent but does not bring about a severe disturbance of the existing hoist moves. We compare our algorithm with two existing approaches with different rescheduling policies (i.e., partial and zero adjustment of the existing schedule). We empirically analyze the productivity and the stability of the schedules generated by the three approaches. Computational results demonstrate that our algorithm can generate more productive and stable schedules than the two existing approaches. Note to Practitioners - Electroplating and chemical surface treatment lines with automated material handling hoists are commonplace in electronics, semiconductor, and many other manufacturing industries. In an uncertain environment, hoist rescheduling plays an important role in improving the productivity and reducing the impact of disruptions. This paper presents a hoist scheduling algorithm to deal with dynamic job arrivals by considering the impact of the disturbance incurred by rescheduling. Our algorithm can generate a better schedule with smaller total completion time and slighter disturbance than the existing algorithms. The proposed algorithm runs in polynomial time and can be used to control hoist operations in practical electroplating lines. A comparative analysis provides useful insights on the implementation of rescheduling approaches and policies to industry practitioners.

Original languageEnglish
Pages (from-to)1423-1430
Number of pages8
JournalIEEE Transactions on Automation Science and Engineering
Volume15
Issue number3
DOIs
StatePublished - Jul 2018
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2004-2012 IEEE.

Funding

Manuscript received May 11, 2017; revised August 10, 2017; accepted August 31, 2017. Date of publication October 6, 2017; date of current version July 2, 2018. This paper was recommended for publication by Associate Editor R. Uzsoy and Editor L. Shi upon evaluation of the reviewers’ comments. This work was supported in part by the National Natural Science Foundation of China under Grant 71571032, Grant 71471145, Grant 71531003, and Grant 71432003 and in part by the Humanities and Social Sciences Fund of Ministry of Education of China under Grant 13XJA790005. (Corresponding author: Ada Che.) P. Yan is with the School of Management and Economics, University of Electronic Science and Technology of China, Chengdu 610054, China (e-mail: [email protected]).

FundersFunder number
National Natural Science Foundation of China71471145, 71531003, 71571032, 71432003
Ministry of Education of the People's Republic of China13XJA790005

    Keywords

    • Automated electroplating line
    • disturbance
    • dynamic jobs arrival
    • polynomial heuristic

    Fingerprint

    Dive into the research topics of 'A Heuristic for Inserting Randomly Arriving Jobs into an Existing Hoist Schedule'. Together they form a unique fingerprint.

    Cite this