This paper reports an ongoing project of applying CSP algorithms CDGT and CDBT to solving job shop scheduling problems with non-relaxable time windows. A simpliied job shop scheduling task is presented to illustrate the procedure where the given task is converted into a CSP and the synthesis algorithm CDGT is combined with the search algorithm CDBT to nd a feasible or the optimal schedule. The ...

This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach ...

Multiprocessor task scheduling is a generalized form of classical machine scheduling where a task is processed by more than one processor. It is a challenging problem encountered in wide range of applications and it is vastly studied in the scheduling literature (see for instance (Chan & Lee, 1999 and Drozdowski, 1996) for a comprehensive introduction on this topic). However, Drozdowski (1996) ...