| Article ID: | iaor2009984 |
| Country: | United Kingdom |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 1250 |
| End Page Number: | 1264 |
| Publication Date: | Apr 2008 |
| Journal: | Computers and Operations Research |
| Authors: | Pardalos Panos M., Mateus Geraldo Robson, Ravetti Martn Gmez, Rocha Pedro Leite |
| Keywords: | programming: branch and bound, programming: integer |
A scheduling problem with unrelated parallel machines, sequence and machine-dependent setup times, due dates and weighted jobs is considered in this work. A branch-and-bound algorithm is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. We also propose a set of instances for this type of problem. The results are compared to the solutions provided by two mixed integer programming models with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.