A robust approach for the single machine scheduling problem

This paper describes a robust approach for the single machine scheduling problem 1|ri|L max. The method is said to be robust since it characterizes a large set of optimal solutions allowing to switch from one solution to another, without any performance loss, in order to face potential disruptions w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of scheduling 2007-06, Vol.10 (3), p.209-221
Hauptverfasser:	Briand, Cyril, La, H Trung, Erschler, Jacques
Format:	Artikel
Sprache:	eng
Schlagworte:	Decision making Fuzzy sets Job shops Lateness Mathematical models Polynomials Production scheduling Robustness Schedules Scheduling Sequences Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!