A model is presented which generalizes shop scheduling problems like job shops, flow shops, open shops, and mixed shops. Into this general model each one of the following features is integrated: Changeover and transportation times, multi-purpose machines, multiprocessor tasks. We give a survey on complexity results for the corresponding scheduling problems and discuss solution approaches.
抄録全体を表示