Auction-based approach for a flexible job-shop scheduling problem with multiple process plans. Issue 11 (2nd November 2019)

• Record Type: Journal Article
• Authors: Zeng, Chengkuan; Tang, Jiafu; Fan, Zhiping; Yan, Chongjun
• Is Part Of: Engineering optimization. Volume 51:Issue 11(2019)
• Page Start: 1902
• Page End: 1919
• Publication Date: 2019-11-02
• Subjects: Flexible job-shop scheduling problem -- multiple process plans -- auction-based approach; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2018.1561884
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This study addresses the flexible job-shop scheduling problem with multiple process plans with the objective of minimizing the overall makespan. A nonlinear programming model is formulated to allocate machines and schedule jobs. An auction-based approach is proposed to address the integrated production route selection and resource allocation problem and focus on improving resource utilization and productive efficiency to reduce the makespan. The approach consists of an auction for process plans and an auction for machines. The auctions are evaluated to select a more suitable route for production and allocate resources to a more desirable job. Numerical experiments are conducted by testing new large benchmark instances. A comparison of Lingo and other existing algorithms demonstrates the effectiveness and stability of the proposed auction-based approach. Furthermore, SPSS is used to prove that the proposed method exhibits an absolute advantage, particularly for medium-scale or large-scale instances.