More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness
We address a manufacturing environment with the no-wait constraint which is common in industries such as metal, plastic, and semiconductor. Setup times are modelled as uncertain with the objective of minimizing maximum lateness which is an important performance measure for customer satisfac...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2022-01-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Online Access: | http://www.growingscience.com/ijiec/Vol13/IJIEC_2022_18.pdf |
| _version_ | 1811283639720214528 |
|---|---|
| author | Harun Aydilek Asiye Aydilek Muberra Allahverdi Ali Allahverdi |
| author_facet | Harun Aydilek Asiye Aydilek Muberra Allahverdi Ali Allahverdi |
| author_sort | Harun Aydilek |
| collection | DOAJ |
| description | We address a manufacturing environment with the no-wait constraint which is common in industries such as metal, plastic, and semiconductor. Setup times are modelled as uncertain with the objective of minimizing maximum lateness which is an important performance measure for customer satisfaction. This problem has been addressed in scheduling literature for the two-machine no-wait flowshop where dominance relations were presented. Recently, another dominance relation was presented and shown to be about 90% more efficient than the earlier ones. In the current paper, we propose two new dominance relations, which are less restrictive than the earlier ones in the literature. The new dominance relations are shown to be 140% more efficient than the most recent one in the literature. As the level of uncertainty increases, the newly proposed dominance relation performs better, which is another strength of the newly proposed dominance relation. Moreover, we also propose constructive heuristics and show that the best of the newly proposed heuristics is 95% more efficient than the existing one in the literature under the same CPU time. |
| first_indexed | 2024-04-13T02:15:04Z |
| format | Article |
| id | doaj.art-a080e3bbacf84075bfaa3047d7b196a3 |
| institution | Directory Open Access Journal |
| issn | 1923-2926 1923-2934 |
| language | English |
| last_indexed | 2024-04-13T02:15:04Z |
| publishDate | 2022-01-01 |
| publisher | Growing Science |
| record_format | Article |
| series | International Journal of Industrial Engineering Computations |
| spelling | doaj.art-a080e3bbacf84075bfaa3047d7b196a32022-12-22T03:07:10ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342022-01-0113454355610.5267/j.ijiec.2022.7.002More effective heuristics for a two-machine no-wait flowshop to minimize maximum latenessHarun AydilekAsiye AydilekMuberra AllahverdiAli Allahverdi We address a manufacturing environment with the no-wait constraint which is common in industries such as metal, plastic, and semiconductor. Setup times are modelled as uncertain with the objective of minimizing maximum lateness which is an important performance measure for customer satisfaction. This problem has been addressed in scheduling literature for the two-machine no-wait flowshop where dominance relations were presented. Recently, another dominance relation was presented and shown to be about 90% more efficient than the earlier ones. In the current paper, we propose two new dominance relations, which are less restrictive than the earlier ones in the literature. The new dominance relations are shown to be 140% more efficient than the most recent one in the literature. As the level of uncertainty increases, the newly proposed dominance relation performs better, which is another strength of the newly proposed dominance relation. Moreover, we also propose constructive heuristics and show that the best of the newly proposed heuristics is 95% more efficient than the existing one in the literature under the same CPU time.http://www.growingscience.com/ijiec/Vol13/IJIEC_2022_18.pdf |
| spellingShingle | Harun Aydilek Asiye Aydilek Muberra Allahverdi Ali Allahverdi More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness International Journal of Industrial Engineering Computations |
| title | More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness |
| title_full | More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness |
| title_fullStr | More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness |
| title_full_unstemmed | More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness |
| title_short | More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness |
| title_sort | more effective heuristics for a two machine no wait flowshop to minimize maximum lateness |
| url | http://www.growingscience.com/ijiec/Vol13/IJIEC_2022_18.pdf |
| work_keys_str_mv | AT harunaydilek moreeffectiveheuristicsforatwomachinenowaitflowshoptominimizemaximumlateness AT asiyeaydilek moreeffectiveheuristicsforatwomachinenowaitflowshoptominimizemaximumlateness AT muberraallahverdi moreeffectiveheuristicsforatwomachinenowaitflowshoptominimizemaximumlateness AT aliallahverdi moreeffectiveheuristicsforatwomachinenowaitflowshoptominimizemaximumlateness |