Minimizing the total completion time in a two-machine flowshop problem with time delays
| Author | Msakni, Mohamed Kais |
| Author | Khallouli, Wael |
| Author | Al-Salem, Mohamed |
| Author | Ladhari, Talel |
| Available date | 2021-09-01T10:02:47Z |
| Publication Date | 2016 |
| Publication Name | Engineering Optimization |
| Resource | Scopus |
| Abstract | This article proposes to solve the problem of minimizing the total completion time in a two-machine permutation flowshop environment in which time delays between the machines are considered. For this purpose, an enumeration algorithm based on the branch-and-bound framework is developed, which includes new lower and upper bounds as well as dominance rules. The computational study shows that problems with up to 40 jobs can be solved in a reasonable amount of time. |
| Language | en |
| Publisher | Taylor and Francis Ltd. |
| Subject | Branch and bound method Time delay Computational studies Enumeration algorithms Flow-shops Iterated greedy algorithm Lower and upper bounds Lower bounds Permutation flow shops Time lag Problem solving |
| Type | Article |
| Pagination | 1164-1181 |
| Issue Number | 7 |
| Volume Number | 48 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
This item appears in the following Collection(s)
-
Mechanical & Industrial Engineering [1306 items ]