A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. Issue 17 (2nd September 2018)

• Record Type: Journal Article
• Authors: Liu, Xinbao; Lu, Shaojun; Pei, Jun; Pardalos, Panos M.
• Is Part Of: International journal of production research. Volume 56:Issue 17(2018)
• Page Start: 5758
• Page End: 5775
• Publication Date: 2018-09-02
• Subjects: supply chain scheduling -- deteriorating jobs -- parallel-batching machines -- transportation -- VNS-HS; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2017.1418986
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : This paper investigates a coordinated scheduling problem in a two stage supply chain where parallel-batching machine, deteriorating jobs and transportation coordination are considered simultaneously. During the production stage, jobs are processed by suppliers and there exists one parallel-batching machine in each supplier. The actual processing time of a job depends on its starting time and normal processing time. The normal processing time of a batch is equal to the largest normal processing time among all jobs in its batch. During the transportation stage, the jobs are then delivered to the manufacturer. Since suppliers are distributed in different locations, the transportation time between each supplier and the manufacturer is different. Based on some structural properties of the studied problem, an optimal algorithm for minimising makespan on a single supplier is presented. This supply chain scheduling problem is proved to be NP-hard, and a hybrid VNS-HS algorithm combining variable neighbourhood search (VNS) with harmony search (HS) is proposed to find a good solution in reasonable time. Finally, some computational experiments are conducted and the results demonstrate the effectiveness and efficiency of the proposed VNS-HS.