We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.
A reclaimer scheduling problem arising in coal stockyard management
ANGELELLI, Enrico;
2016-01-01
Abstract
We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
id 11379-488983 AReclaimerSchedulingProblemAri.pdf
gestori archivio
Descrizione: Articolo principale
Tipologia:
Full Text
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
798.19 kB
Formato
Adobe PDF
|
798.19 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.
