• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Worst case performance evaluation of flexible solutions in single machine scheduling

Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude (2003), Worst case performance evaluation of flexible solutions in single machine scheduling, Multiconference on Computational Engineering in Systems Applications (CESA'2003), 2003-07, Lille, France

Type
Communication / Conférence
Date
2003
Conference title
Multiconference on Computational Engineering in Systems Applications (CESA'2003)
Conference date
2003-07
Conference city
Lille
Conference country
France
Metadata
Show full item record
Author(s)
Aloulou, Mohamed Ali
Kovalyov, Mikhail Y.
Portmann, Marie-Claude
Abstract (EN)
In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in single machine scheduling. A flexible solution is a set of schedules following a structure defined by a partial order of jobs and a type of schedules. here, we consider active and non-delay schedules. The proposed structure allows the decision maker to dispose of some flexibility (a set of schedules instead of one schedule) that can be used on-line to absorb the impact of data disturbances related to, for example, job arrival, tool availability or machine breakdowns. The performance is a function of (i) the best case performance providing the decision maker a lower bound of the performance, (ii) the worst case performance giving him a guarantee about how poorly the solution may perform, in both cases when following the considered structure. The worst cases correspond to new scheduling problems, in which a regular criterion must be maximized. We present new algorithms and/or new computational complexity results, in presence of: one machine, different release dates, precedence constraints and various criteria to be maximized. || Nous nous intéressons dans ce papier à l'évaluation de performance dans le pire des cas pour des solutions d'ordonnancement flexibles pour des problèmes d'ordonnancement à une machine.
Subjects / Keywords
scheduling; single machine; scheduling flexibility; maximization problems; machine; ordonnancement; flexibilité; problèmes de maximisation

Related items

Showing items related by title and author.

  • Thumbnail
    Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of a computational complexity 
    Portmann, Marie-Claude; Kovalyov, Mikhail Y.; Aloulou, Mohamed Ali (2007) Article accepté pour publication ou publié
  • Thumbnail
    Maximization of single machine scheduling 
    Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude (2004) Article accepté pour publication ou publié
  • Thumbnail
    Worst-case evaluation of flexible solutions in disjunctive scheduling problems 
    Aloulou, Mohamed Ali; Artigues, Christian (2007) Communication / Conférence
  • Thumbnail
    A flexible proactive-reactive approach: the case of an assembly workshop 
    Aloulou, Mohamed Ali; Portmann, Marie-Claude (2008) Chapitre d'ouvrage
  • Thumbnail
    Minimizing the number of late jobs on a single machine under due date uncertainty 
    Aissi, Hassene; Aloulou, Mohamed Ali; Kovalyov, Mikhail Y. (2011) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo