Scheduling: Agreement graph vs resource constraints

We investigate two scheduling problems. The first is scheduling with agreements (SWA) that consists in scheduling a set of jobs non-preemptively on identical machines in a minimum time, subject to constraints that only some specific jobs can be scheduled concurrently. These constraints are represent...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2015-01, Vol.240 (2), p.355-360
Hauptverfasser:	Cherif, W. Ramdane, Rahmani, Younes, Ramdane, Wahiba, Kovalyov, Mikhail, Soukhal, Ameur, Bendraouche, Mohamed, Boudhar, Mourad, Oulamara, Ammar
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Operations Research
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!