IRIS

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.

Agnetis, A., Kellerer, H., Nicosia, G., Pacifici, A. (2012). Parallel dedicated machines scheduling with chain precedence constraints. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 221(2), 296-305 [http://dx.doi.org/10.1016/j.ejor.2012.03.040].

Parallel dedicated machines scheduling with chain precedence constraints

PACIFICI, ANDREA
2012-01-01

Abstract

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.
2012
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore MAT/09 - RICERCA OPERATIVA
English
Scheduling; Parallel dedicated machines; Precedence constraints; Two-job job shop; Computational com
Agnetis, A., Kellerer, H., Nicosia, G., Pacifici, A. (2012). Parallel dedicated machines scheduling with chain precedence constraints. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 221(2), 296-305 [http://dx.doi.org/10.1016/j.ejor.2012.03.040].
Agnetis, A; Kellerer, H; Nicosia, G; Pacifici, A
Articolo su rivista
01 - Articolo su rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/2108/81674
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 11
social impact