Skip to Main content Skip to Navigation
Journal articles

Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

Abstract : Abstract In job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03367156
Contributor : Damien Trentesaux Connect in order to contact the contributor
Submitted on : Wednesday, October 6, 2021 - 9:47:19 AM
Last modification on : Saturday, October 9, 2021 - 3:21:37 AM

Links full text

Identifiers

Collections

Citation

Moussa Abderrahim, Abdelghani Bekrar, Damien Trentesaux, Nassima Aissani, Karim Bouamrane. Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints. Optimization Letters, Springer Verlag, 2021, 128, pp.103435. ⟨10.1007/s11590-020-01674-0⟩. ⟨hal-03367156⟩

Share

Metrics

Record views

3