A GRASP and branch-and-bound metaheuristic for the job-shop scheduling
2007
This paper presents a simple algorithm for the job shop scheduling problem that combines the local search heuristic GRASP with a branch-and-bound exact method of integer programming. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
31
References
12
Citations
NaN
KQI