Show simple item record

dc.contributor.authorAloulou, Mohamed Ali
dc.contributor.authorArtigues, Christian
dc.date.accessioned2010-01-09T14:53:43Z
dc.date.available2010-01-09T14:53:43Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2846
dc.descriptionPublié dans les Annales du LAMSADE, n°7, 2007, p.33-52
dc.language.isoenen
dc.subjectWorst-case Performance Evaluationen
dc.subjectRobustnessen
dc.subjectFlexibilityen
dc.subjectFlow-Shop Schedulingen
dc.subjectDisjunctive Schedulingen
dc.subject.ddc003en
dc.titleFlexible solutions in disjunctive scheduling: general formulation and study of the flow-shop caseen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to provide the decision maker a characterization of possible modifications of the predictive schedule while preserving optimality. In the context of machine scheduling, the anticipated modifications are changes in the predictive order of operations on the machines. To achieve this goal, a flexible solution feasible w.r.t to operations deadlines, is provided instead of a single predictive schedule. A flexible solution represents a set of semi-active schedules and is characterized by a partial order on each machine, so that the total order can be set on-line, as required by the decision maker. A flexible solution is feasible if all the complete schedules that can be obtained by extension are also feasible. In this paper we develop two main issues. The first one concerns the evaluation of a flexible solution in the worst case allowing to certify if the solution is feasible. The second issue is the computation of feasible (w.r.t deadlines) flexible solutions of maximal flexibility imposed by the decision maker. Under an epsilon-constraint framework, solving this problem allows to find compromise solutions for the flexibility criterion and any minmax regular scheduling criterion. The special case of the flow-shop scheduling problem is studied and computational experiments are carried out.en
dc.relation.isversionofjnlnameComputers and Operations Research
dc.relation.isversionofjnlvol37en
dc.relation.isversionofjnlissue5en
dc.relation.isversionofjnldate2010-05
dc.relation.isversionofjnlpages890-898en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.cor.2009.03.021en
dc.identifier.urlsitehttp://hal.archives-ouvertes.fr/hal-00121449/en/
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


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