Kurera PBC
[Thesis-Full-text]
Job Shop Scheduling Problem (JSSP) is a non-deterministic, polynomial-time (NP) hard combinatorial optimization problem. It is one of the most common problems in manufacturing due to its widespread application and the ...