A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C = 2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.

Detti, P. (2008). Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions. JOURNAL OF SCHEDULING, 11, 205-212 [10.1007/s10951-008-0054-z].

Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

DETTI, PAOLO
2008-01-01

Abstract

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C = 2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.
2008
Detti, P. (2008). Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions. JOURNAL OF SCHEDULING, 11, 205-212 [10.1007/s10951-008-0054-z].
File in questo prodotto:
File Dimensione Formato  
JosDetti.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 506.31 kB
Formato Adobe PDF
506.31 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/11224
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo