In this paper we introduce a new class of greedy heuristics for general job shop scheduling problems. In particular we deal with the classical job shop, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other greedy algorithms are presented.
Pranzo, M., Meloni, C., Pacciarelli, D. (2003). A new class of greedy heuristics for job shop scheduling problems. In 2nd International Workshop on Experimental and Efficient Algorithms (pp.223-236). Berlin : Springer [10.1007/3-540-44867-5_19].
A new class of greedy heuristics for job shop scheduling problems
PRANZO, MARCO;
2003-01-01
Abstract
In this paper we introduce a new class of greedy heuristics for general job shop scheduling problems. In particular we deal with the classical job shop, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other greedy algorithms are presented.
| File | Dimensione | Formato | |
|---|---|---|---|
|
2003-LNCS.pdf
non disponibili
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
209.96 kB
Formato
Adobe PDF
|
209.96 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.
https://hdl.handle.net/11365/11881