Techniques for the Job Shop Scheduling Problem: a Survey
车间作业调度(JSSP)技术问题简明综述

This paper aims to provide a concise survey of scheduling theories concerning job shop scheduling problem by dealing with classification of related algorithms, characteristic and general framework of JSSP. The research methods are divided into two classes: the optimization and the heuristics. The methods under each approach are analyzed and compared with the others. At last, problems, which need further investigating and possible research directions, are pointed out