Show simple item record

dc.contributor.authorBouzaiene, Afef
dc.contributor.authorAloulou, Mohamed Ali
dc.contributor.authorDridi, Najoua
dc.contributor.authorVanderpooten, Daniel
dc.date.accessioned2012-07-11T15:08:43Z
dc.date.available2012-07-11T15:08:43Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/9734
dc.language.isoenen
dc.subjectlimited batch size
dc.subjecttwo-machine flow-shop
dc.subjectmakespan
dc.subjectbatch cost
dc.subjectserial batching
dc.subject.ddc003en
dc.titleThe two-machine flow-shop serial-batching scheduling problem with limited batch size
dc.typeCommunication / Conférence
dc.description.abstractenWe consider the the two-machine flow-shop serial-batching scheduling problem where thebatches have limited size. Two criteria are considered here. The first criterion is to minimizethe number of batches. This criterion reflects situations where processing of any batchinduces a fixed cost, which leads to a total cost proportional to the number of batches. Thesecond criterion is the makespan. We study the complexity of the problem and proposepolynomial-time algorithms for some particular cases and an approximation algorithm witha guaranteed performance for the general case.
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.conftitle12th International Conference on Project Management and Scheduling (PMS 2010)
dc.relation.confcityTours
dc.relation.confcountryFRANCE
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2016-10-06T10:26:13Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record