Wang L., D.Z. Zheng, (2001). "An effective hybrid optimization strategy for job-shop scheduling problems," Computers and Operations Research, 28, 585-596. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On Solving the Classic Job Shop Makespan Problem by.. - Schultz, Hodgson, King (2004) (Correct)
....Albrecht and Wong [16] use a simulated annealing approach for the job shop problem. They apply their heuristic on 8 unsolved benchmark problems and identify new upper bounds on 5 of these problems. In a second paper [17] they note an additional new upper bound that is also optimal. Wang and Zheng [21] combine a genetic algorithm with simulated annealing to solve the job shop problem. Their approach is shown to be effective and robust on a small selection of benchmark problems. 2. Problem Description The job shop problem is to schedule a set of N jobs on M machines. Each job i has a process ....
Wang L., D.Z. Zheng, (2001). "An effective hybrid optimization strategy for job-shop scheduling problems," Computers and Operations Research, 28, 585-596.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC