Journal
OPTIMIZATION LETTERS
Volume 16, Issue 1, Pages 255-280Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-020-01674-0
Keywords
Job-shop scheduling; Transport constraints; Variable neighborhood search
Funding
- Directorate General for Scientific Research and Technological Development (DGRSDT), an institution of the Algerian Ministry of Higher Education and Scientific Research
Ask authors/readers for more resources
This paper addresses the problem of job assignment in a job-shop manufacturing system and proposes an improved algorithm to minimize the maximum completion time of a job set. Experimental tests demonstrate the effectiveness of the proposed approach.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available