Survey of Optimization Algorithms for Job Shop Scheduling

摘要

In this survey optimization methods for the job shop problem are discussed. Most211u001eof the algorithms developed so far branch and bound algoirithms. Different ways 211u001eof branching and computing lower bounds are main issues in this overview. The 211u001ecomputational efforts done in each node are also discussed. In branch and bound 211u001ealgorithms finding a good balance between the computational efforts in each node 211u001eand the number of nodes investigated is crucial for the efficiency of the 211u001ealgorithm. Results of several algorithms are compared.