Bibliographic Details
| Title: |
A cooperative iterated greedy algorithm for the serial distributed permutation flowshop scheduling problem. |
| Authors: |
Han, Biao1 (AUTHOR), Pan, Quan-Ke1 (AUTHOR) panquanke@shu.edu.cn, Gao, Liang2 (AUTHOR) |
| Source: |
International Journal of Production Research. Jun2024, Vol. 62 Issue 12, p4245-4272. 28p. |
| Subject Terms: |
*Linear programming, *Scheduling, Greedy algorithms, Distributed algorithms, Permutations |
| Company/Entity: |
National Endowment for the Humanities |
| Abstract: |
This paper addresses a serial distributed permutation flowshop scheduling problem (SDPFSP) inspired by a printed circuit board assembly process that contains two production stages linked by a transportation stage, where the scheduling problem in each production stage can be seen as a distributed permutation flowshop scheduling problem (DPFSP). A sequence-based mixed-integer linear programming model is established. A solution representation consisting of two components, one component per stage, is presented and a makespan calculation method is given for the representation. Two suites of accelerations based on the insertion neighbourhood are proposed to reduce the computational complexity. A cooperative iterated greedy (CIG) algorithm is developed with two subloops, each of which optimises a component of the solution. A collaboration mechanism is used to conduct the collaboration of the two subloops effectively. Problem-specific operators including the NEH-based heuristics, destruction, reconstruction and three local search procedures, are designed. Extensive computational experiments and statistical analysis verify the validity of the model, the effectiveness of the proposed CIG algorithm and the superiority of the proposed CIG over the existing methods for solving the problem under consideration. [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 or posted to a listserv without the copyright holder's express written permission. 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: |
Business Source Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
