期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 239, 期 1, 页码 214-226出版社
ELSEVIER
DOI: 10.1016/j.ejor.2014.05.014
关键词
OR in health services; Parallel batch scheduling; Makespan; Branch and bound heuristic
In this paper, we address the problem of parallel batching of jobs on identical machines to minimize makespan. The problem is motivated from the washing step of hospital sterilization services where jobs have different sizes, different release dates and equal processing times. Machines can process more than one job at the same time as long as the total size of jobs in a batch does not exceed the machine capacity. We present a branch and bound based heuristic method and compare it to a linear model and two other heuristics from the literature. Computational experiments show that our method can find high quality solutions within short computation time. (C) 2014 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据