Titlebook: Computational Intelligence for Optimization; Nirwan Ansari,Edwin Hou Book 1997 Springer Science+Business Media New York 1997 Pattern Match

脆弱吧

Job Shop Scheduling,nt of all tasks on the machines that satisfies the precedence constraints. Usually the number of constraints is very large, which makes JSP one of the hardest combinatorial problems (an .-complete problems, [99] and [57]. The flow shop problem (FSP), a much restricted version of JSP, can be reduced to the traveling salesman problem (TSP) [137].