• français
    • English
  • français 
    • 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

Complexity of single machine scheduling problems under scenario-based uncertainty

Thumbnail
Date
2008
Dewey
Recherche opérationnelle
Sujet
Scheduling; Scenario-based uncertainty; Absolute robustness
Journal issue
Operations Research Letters
Volume
36
Number
3
Publication date
05-2008
Article pages
338-342
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.orl.2007.11.005
URI
https://basepub.dauphine.fr/handle/123456789/2837
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Della Croce, Federico
Aloulou, Mohamed Ali
Type
Article accepté pour publication ou publié
Abstract (EN)
We present algorithmic and computational complexity results for several single machine scheduling problems where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. We use here the so-called absolute robustness criterion to select among feasible solutions.

  • 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.