• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

Thumbnail
Date
2010
Notes
Publié dans les Annales du LAMSADE, n°7, 2007, p.33-52
Link to item file
http://hal.archives-ouvertes.fr/hal-00121449/en/
Dewey
Recherche opérationnelle
Sujet
Worst-case Performance Evaluation; Robustness; Flexibility; Flow-Shop Scheduling; Disjunctive Scheduling
Journal issue
Computers and Operations Research
Volume
37
Number
5
Publication date
05-2010
Article pages
890-898
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.cor.2009.03.021
URI
https://basepub.dauphine.fr/handle/123456789/2846
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Aloulou, Mohamed Ali
Artigues, Christian
Type
Article accepté pour publication ou publié
Abstract (EN)
We 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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.