Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2003-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S016117120321019X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556602178142208 |
|---|---|
| author | Ali Allahverdi Tariq Aldowaisan Yuri N. Sotskov |
| author_facet | Ali Allahverdi Tariq Aldowaisan Yuri N. Sotskov |
| author_sort | Ali Allahverdi |
| collection | DOAJ |
| description | This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given. |
| format | Article |
| id | doaj-art-32c307f532ae44108781fcb72cd81bf4 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 2003-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-32c307f532ae44108781fcb72cd81bf42025-02-03T05:44:48ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252003-01-012003392475248610.1155/S016117120321019XTwo-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup timesAli Allahverdi0Tariq Aldowaisan1Yuri N. Sotskov2Department of Industrial and Management Systems Engineering, College of Engineering and Petroleum, Kuwait University, P. O. Box 5969, Safat, KuwaitDepartment of Industrial and Management Systems Engineering, College of Engineering and Petroleum, Kuwait University, P. O. Box 5969, Safat, KuwaitInstitute of Engineering Cybernetics, 6 Surganova Street, Minsk 220012, BelarusThis paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given.http://dx.doi.org/10.1155/S016117120321019X |
| spellingShingle | Ali Allahverdi Tariq Aldowaisan Yuri N. Sotskov Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times International Journal of Mathematics and Mathematical Sciences |
| title | Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times |
| title_full | Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times |
| title_fullStr | Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times |
| title_full_unstemmed | Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times |
| title_short | Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times |
| title_sort | two machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times |
| url | http://dx.doi.org/10.1155/S016117120321019X |
| work_keys_str_mv | AT aliallahverdi twomachineflowshopschedulingproblemtominimizemakespanortotalcompletiontimewithrandomandboundedsetuptimes AT tariqaldowaisan twomachineflowshopschedulingproblemtominimizemakespanortotalcompletiontimewithrandomandboundedsetuptimes AT yurinsotskov twomachineflowshopschedulingproblemtominimizemakespanortotalcompletiontimewithrandomandboundedsetuptimes |