Scheduling with multi-attribute set-up times on unrelated parallel machines.
Saved in:
| Title: | Scheduling with multi-attribute set-up times on unrelated parallel machines. |
|---|---|
| Authors: | Liao, Ching-Jong1 (AUTHOR), Lee, Cheng-Hsiung2 (AUTHOR) brucelee@mail.chihlee.edu.tw, Tsai, Hsing-Tzu1 (AUTHOR) |
| Source: | International Journal of Production Research. Aug2016, Vol. 54 Issue 16, p4839-4853. 15p. 1 Color Photograph, 3 Diagrams, 11 Charts. |
| Subjects: | Setup time, Parallel scheduling (Computer scheduling), Textile machinery, Textile industry, Production scheduling, Heuristic algorithms |
| Abstract: | This paper studies a problem in the knitting process of the textile industry. In such a production system, each job has a number of attributes and each attribute has one or more levels. Because there is at least one different attribute level between two adjacent jobs, it is necessary to make a set-up adjustment whenever there is a switch to a different job. The problem can be formulated as a scheduling problem with multi-attribute set-up times on unrelated parallel machines. The objective of the problem is to assign jobs to different machines to minimise the makespan. A constructive heuristic is developed to obtain a qualified solution. To improve the solution further, a meta-heuristic that uses a genetic algorithm with a new crossover operator and three local searches are proposed. The computational experiments show that the proposed constructive heuristic outperforms two existed heuristics and the current scheduling method used by the case textile plant. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | This paper studies a problem in the knitting process of the textile industry. In such a production system, each job has a number of attributes and each attribute has one or more levels. Because there is at least one different attribute level between two adjacent jobs, it is necessary to make a set-up adjustment whenever there is a switch to a different job. The problem can be formulated as a scheduling problem with multi-attribute set-up times on unrelated parallel machines. The objective of the problem is to assign jobs to different machines to minimise the makespan. A constructive heuristic is developed to obtain a qualified solution. To improve the solution further, a meta-heuristic that uses a genetic algorithm with a new crossover operator and three local searches are proposed. The computational experiments show that the proposed constructive heuristic outperforms two existed heuristics and the current scheduling method used by the case textile plant. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2015.1118574 |
