Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in order to minimize the makespan. We develop three heuristic approaches, i.e., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound pro...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.2/3446 |
| Country: | Portugal |
| Oai: | oai:repositorioaberto.uab.pt:10400.2/3446 |