Optimal scheduling of the reentrant multi-degree cyclic multi-hoist scheduling problem

Xin Stephen LI, Yanchun PAN, Richard Y. K. FUNG

Research output: Chapter in Book/Report/Conference proceedingChapters

Abstract

The current paper deals with the cyclic multi-hoist scheduling problem in electroplating lines considering rentrance. Identical parts are produced with processing time windows. Moreover, re-entrance is also considered. These together make it more challenged to obtain better schedules improving the productivity. To achieve this, multi-degree cycles are considered. To our best knowledge, this is the first research in this generally complicated scenario. In order to maximize the productivity of the production line, i.e. minimize the cycle time for a given degree, operations of hoists are first analyzed in detail to avoid their collision. Then, operations related the re-entrance are modeled. Based on these work, a mixed integer linear programming model is proposed. An industrial instances is used to test the proposed model. It is solved using the commercial software ILOG CPLEX. Results illustrate the efficiency of the proposed approach. Copyright © 2019 IEEE.

Original languageEnglish
Title of host publicationProceedings of 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)
Place of PublicationUSA
PublisherIEEE
Pages1319-1323
ISBN (Electronic)9781728138046
ISBN (Print)9781728138053
DOIs
Publication statusPublished - 2020

Citation

Li, X., Pan, Y., & Fung, R. Y. K. (2020). Optimal scheduling of the reentrant multi-degree cyclic multi-hoist scheduling problem. In Proceedings of 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) (pp. 1319-1323). USA: IEEE.

Fingerprint

Dive into the research topics of 'Optimal scheduling of the reentrant multi-degree cyclic multi-hoist scheduling problem'. Together they form a unique fingerprint.