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 axe presented
A new class of greedy heuristics for job shop scheduling problems / Pranzo, M.; Meloni, Carlo; Pacciarelli, D.. - 2647:(2003), pp. 223-236. (Intervento presentato al convegno 2nd International Workshop on Experimental and Efficient Algorithms, WEA 2003 tenutosi a Ascona, Switzerland nel May 26-28, 2003).
A new class of greedy heuristics for job shop scheduling problems
MELONI, Carlo;
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 axe presentedI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
