Batch scheduling with deadlines on parallel machines: An NP-hard case

The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. (1997) and Kovalyov and Shafransky (1994). A classification of computational complexities of special cases was provided only for the situation when all groups h...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1997-10, Vol.64 (2), p.69-74
Hauptverfasser:	Kovalyov, Mikhail Y., Shafransky, Yakov M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Batching Computational complexity Computer science control theory systems Exact sciences and technology Parallel machine scheduling Parallel processing Production scheduling Studies Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!