期刊
COMPUTERS & OPERATIONS RESEARCH
卷 41, 期 -, 页码 94-97出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2013.08.015
关键词
Scheduling; Parallel machines; Single server
We consider the problem of scheduling a set of non-preemptable jobs on two identical parallel machines such that the makespan is minimized. Before processing, each job must be loaded on a machine, which takes a given setup time. All these setups have to be done by a single server which can handle at most one job at a time. For this problem, we propose a mixed integer linear programming formulation based on the idea of decomposing a schedule into a set of blocks. We compare the results obtained by the model suggested with known heuristics from the literature. (C) 2013 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据