Show simple item record

dc.contributor.authorHidri, L.
dc.contributor.authorHaouari, Mohamed
dc.date.accessioned2012-08-23T06:57:01Z
dc.date.available2012-08-23T06:57:01Z
dc.date.issued2011-07-01
dc.identifier.issn0096-3003
dc.identifier.urihttp://hdl.handle.net/10679/244
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0096300311003328
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractIn this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on the concept of revised energetic reasoning. Also, we describe an optimization-based heuristic that requires iteratively solving a sequence of parallel machine problems with heads and tails. We present the results of extensive computational experiments that provide evidence that the proposed bounding procedures consistently improve the best existing ones.en_US
dc.description.sponsorshipFatimah Alnijris Research Chair for Advanced Manufacturing Technology
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.ispartofApplied Mathematics and Computation
dc.rightsrestrictedAccess
dc.titleBounding strategies for the hybrid flow shop scheduling problemen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.ozuauthorHaouari, Mohamed
dc.identifier.volume217
dc.identifier.issue21
dc.identifier.startpage8248
dc.identifier.endpage8263
dc.identifier.wosWOS:000290622200010
dc.identifier.doi10.1016/j.amc.2011.02.108
dc.subject.keywordsSchedulingen_US
dc.subject.keywordsHybrid flow shopen_US
dc.subject.keywordsLower boundsen_US
dc.subject.keywordsHeuristicsen_US
dc.identifier.scopusSCOPUS:2-s2.0-79956080278
dc.contributor.authorMale1


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


Share this page