Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474092 | Computers & Operations Research | 2008 | 15 Pages |
Abstract
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 (B&B) 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 (MIP) with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Pedro Leite Rocha, Martín Gómez Ravetti, Geraldo Robson Mateus, Panos M. Pardalos,