期刊
COMPUTERS & OPERATIONS RESEARCH
卷 35, 期 4, 页码 1250-1264出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2006.07.015
关键词
scheduling; GRASP; branch-and-bound; sequence-dependent setups; machine-dependent setups; parallel machines
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. (C) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据