Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 61-76 |
| Number of pages | 16 |
| Journal | Computational Optimization and Applications |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| State | Published - Sep 2010 |
Keywords
- Backbone
- Big valley
- Job shop scheduling problem
- Makespan
- Metaheuristic
Fingerprint
Dive into the research topics of 'Solving job shop scheduling problems utilizing the properties of backbone and "big valley"'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver