Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 47, Issue 1, Pages 61-76Publisher
SPRINGER
DOI: 10.1007/s10589-008-9206-5
Keywords
Job shop scheduling problem; Makespan; Backbone; Big valley; Metaheuristic
Funding
- NSF
- AirForce
Ask authors/readers for more resources
In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and big valley properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high efficiency of our approach. New upper bounds have been obtained for many problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available