OPTIMIZING SCHEDULING IN A JOB-SHOP USING EVENT GRAPHS: STILL AN OPEN PROBLEM

The properties of event graphs have been used to analyze the cyclic scheduling problem in job-shops. The main steps of this research are recalled in this paper, and the most recent heuristic algorithm is presented. We show how simulated annealing can be used to improve this algorithm. We also suggest some directions for future research.