| Article ID: | iaor20021689 |
| Country: | Netherlands |
| Volume: | 133 |
| Issue: | 1 |
| Start Page Number: | 183 |
| End Page Number: | 189 |
| Publication Date: | Aug 2001 |
| Journal: | European Journal of Operational Research |
| Authors: | Laporte Gilbert, Gendreau Michel, Guimares Eduardo Morais |
| Keywords: | heuristics |
This article proposes lower bounds, as well as a divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times (MSPS). The heuristic is tested on randomly generated instances and compared with a previously published tabu search algorithm. Results show that the proposed heuristic is much faster than tabu search while providing similar quality solutions.