• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Yan, Pengyu (Yan, Pengyu.) [1] | Che, Ada (Che, Ada.) [2] | Levner, Eugene (Levner, Eugene.) [3] | Liu, Shi Qiang (Liu, Shi Qiang.) [4]

Indexed by:

EI Scopus SCIE

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.

Keyword:

Automated electroplating line disturbance dynamic jobs arrival polynomial heuristic

Community:

  • [ 1 ] [Yan, Pengyu]Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu 610054, Sichuan, Peoples R China
  • [ 2 ] [Che, Ada]Northwestern Polytech Univ, Sch Management, Xian 710072, Shaanxi, Peoples R China
  • [ 3 ] [Levner, Eugene]Holon Inst Technol, IL-5810201 Holon, Israel
  • [ 4 ] [Liu, Shi Qiang]Fuzhou Univ, Sch Econ & Management, Fuzhou 350108, Fujian, Peoples R China

Reprint 's Address:

  • [Che, Ada]Northwestern Polytech Univ, Sch Management, Xian 710072, Shaanxi, Peoples R China

Show more details

Version:

Related Keywords:

Source :

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING

ISSN: 1545-5955

Year: 2018

Issue: 3

Volume: 15

Page: 1423-1430

5 . 2 2 4

JCR@2018

5 . 9 0 0

JCR@2023

ESI Discipline: ENGINEERING;

ESI HC Threshold:170

JCR Journal Grade:1

CAS Journal Grade:2

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 1

Online/Total:73/10061337
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1