A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time
Advanced production systems usually are complex in nature and aim to deal with multiple performance measures simultaneously. Therefore, in most cases, the consideration of a single objective function is not sufficient to properly solve scheduling problems. This paper investigates the multi-...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2024-01-01
|
| Series: | Journal of Project Management |
| Online Access: | http://www.growingscience.com/jpm/Vol9/jpm_2023_12.pdf |
| _version_ | 1797389186075983872 |
|---|---|
| author | Marcelo Seido Nagano Fernando Luis Rossi |
| author_facet | Marcelo Seido Nagano Fernando Luis Rossi |
| author_sort | Marcelo Seido Nagano |
| collection | DOAJ |
| description | Advanced production systems usually are complex in nature and aim to deal with multiple performance measures simultaneously. Therefore, in most cases, the consideration of a single objective function is not sufficient to properly solve scheduling problems. This paper investigates the multi-objective mixed no-idle flowshop scheduling problem. The addressed optimization case is minimizing makespan subject to an upper bound on total completion time. To solve this problem, we proposed a two-stage iterated greedy and a multi-objective constructive heuristic. Moreover, we developed a new multi-objective improvement procedure focusing on increasing the performance of the developed methods in solving the addressed problem. and a new initialization procedure. We performed several computational tests in order to compare our developed methods with the main algorithms from similar scheduling problems in the literature. It was revealed that the proposed approaches give the best results compared with other state-of-the-art performing methods. |
| first_indexed | 2024-03-08T22:52:12Z |
| format | Article |
| id | doaj.art-0d9de65025144832a71388e10dd8fb11 |
| institution | Directory Open Access Journal |
| issn | 2371-8366 2371-8374 |
| language | English |
| last_indexed | 2024-03-08T22:52:12Z |
| publishDate | 2024-01-01 |
| publisher | Growing Science |
| record_format | Article |
| series | Journal of Project Management |
| spelling | doaj.art-0d9de65025144832a71388e10dd8fb112023-12-16T08:35:09ZengGrowing ScienceJournal of Project Management2371-83662371-83742024-01-0191456010.5267/j.jpm.2023.9.001A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion timeMarcelo Seido NaganoFernando Luis Rossi Advanced production systems usually are complex in nature and aim to deal with multiple performance measures simultaneously. Therefore, in most cases, the consideration of a single objective function is not sufficient to properly solve scheduling problems. This paper investigates the multi-objective mixed no-idle flowshop scheduling problem. The addressed optimization case is minimizing makespan subject to an upper bound on total completion time. To solve this problem, we proposed a two-stage iterated greedy and a multi-objective constructive heuristic. Moreover, we developed a new multi-objective improvement procedure focusing on increasing the performance of the developed methods in solving the addressed problem. and a new initialization procedure. We performed several computational tests in order to compare our developed methods with the main algorithms from similar scheduling problems in the literature. It was revealed that the proposed approaches give the best results compared with other state-of-the-art performing methods.http://www.growingscience.com/jpm/Vol9/jpm_2023_12.pdf |
| spellingShingle | Marcelo Seido Nagano Fernando Luis Rossi A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time Journal of Project Management |
| title | A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time |
| title_full | A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time |
| title_fullStr | A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time |
| title_full_unstemmed | A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time |
| title_short | A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time |
| title_sort | two stage iterated greedy algorithm and a multi objective constructive heuristic for the mixed no idle flowshop scheduling problem to minimize makespan subject to total completion time |
| url | http://www.growingscience.com/jpm/Vol9/jpm_2023_12.pdf |
| work_keys_str_mv | AT marceloseidonagano atwostageiteratedgreedyalgorithmandamultiobjectiveconstructiveheuristicforthemixednoidleflowshopschedulingproblemtominimizemakespansubjecttototalcompletiontime AT fernandoluisrossi atwostageiteratedgreedyalgorithmandamultiobjectiveconstructiveheuristicforthemixednoidleflowshopschedulingproblemtominimizemakespansubjecttototalcompletiontime AT marceloseidonagano twostageiteratedgreedyalgorithmandamultiobjectiveconstructiveheuristicforthemixednoidleflowshopschedulingproblemtominimizemakespansubjecttototalcompletiontime AT fernandoluisrossi twostageiteratedgreedyalgorithmandamultiobjectiveconstructiveheuristicforthemixednoidleflowshopschedulingproblemtominimizemakespansubjecttototalcompletiontime |