Show simple item record

AuthorMsakni, Mohamed Kais
AuthorKhallouli, Wael
AuthorAl-Salem, Mohamed
AuthorLadhari, Talel
Available date2021-09-01T10:02:47Z
Publication Date2016
Publication NameEngineering Optimization
ResourceScopus
URIhttp://dx.doi.org/10.1080/0305215X.2015.1099639
URIhttp://hdl.handle.net/10576/22402
AbstractThis 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.
Languageen
PublisherTaylor and Francis Ltd.
SubjectBranch 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
TitleMinimizing the total completion time in a two-machine flowshop problem with time delays
TypeArticle
Pagination1164-1181
Issue Number7
Volume Number48
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record