Show simple item record

AuthorLahimer, Asma
AuthorLopez, Pierre
AuthorHaouari, Mohamed
Available date2023-01-23T08:18:14Z
Publication Date2013
Publication NameComputers and Industrial Engineering
ResourceScopus
URIhttp://dx.doi.org/10.1016/j.cie.2013.08.004
URIhttp://hdl.handle.net/10576/38711
AbstractIn this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, we propose a discrepancy search heuristic that is based on the new concept of adjacent discrepancies. Moreover, we describe a new lower bound based on the concept of dual feasible functions. The proposed lower and upper bounds are assessed through computational experiments conducted on 300 benchmark instances with up to 100 jobs and 8 stages. For these instances, we provide evidence that the proposed bounds consistently outperform the best existing ones. In particular, the proposed heuristic successfully improved the best known solution of 75 benchmark instances. 2013 Elsevier Ltd. All rights reserved.
Languageen
SubjectDiscrepancy search
Dual feasible functions
Hybrid flow-shop scheduling
Multiprocessor tasks
TitleImproved bounds for hybrid flow shop scheduling with multiprocessor tasks
TypeArticle
Pagination1106-1114
Issue Number4
Volume Number66
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