A hybrid decomposition approach using increasing clusters for solving scheduling problems with minimal and maximal time lags
Résumé
In this article we present a priority rule construction algorithm couopled with a cluster decomposition method in order to construct feasible solutions for general scheduling problems with minimal and maximal time lag constraints. Algorithm performances have been tested on job shop scheduling problems and also a real chemical freeze-drying process.