The use of stochastic variable and value ordering heuristics for solving job shop scheduling problems with non-relaxable deadlines and complex metric constraints is investigated. Stochastic counterparts are specified to previously developed search heuristics. Experimental results on job shop scheduling CSPs of increasing size demonstrate comparative advantage over chronological backtracking. Comparison is also made to heuristic-biased stochastic sampling (HBSS).
Stochastic procedures for generating feasible schedules
Oddi;Angelo;
1997
Abstract
The use of stochastic variable and value ordering heuristics for solving job shop scheduling problems with non-relaxable deadlines and complex metric constraints is investigated. Stochastic counterparts are specified to previously developed search heuristics. Experimental results on job shop scheduling CSPs of increasing size demonstrate comparative advantage over chronological backtracking. Comparison is also made to heuristic-biased stochastic sampling (HBSS).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.
