Block models for scheduling jobs on two parallel machines with a single server

被引：22

作者：

Hasani, Keramat ^{[1
]}

Kravchenko, Svetlana A. ^{[2
]}

Werner, Frank ^{[3
]}

机构：

[1] Islamic Azad Univ, Malayer Branch, Malayer, Iran

[2] United Inst Informat Problems, Minsk 220012, BELARUS

[3] Univ Magdeburg, Fak Math, D-39016 Magdeburg, Germany

来源：

COMPUTERS & OPERATIONS RESEARCH | 2014年 / 41卷

关键词：

Scheduling; Parallel machines; Single server;

D O I：

10.1016/j.cor.2013.08.015

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：94 / 97

页数：4

共 6 条

[1] Scheduling two parallel machines with a single server: the general case [J].