The coupled unit-time operations problem on identical parallel machines with respect to the makespan

被引：0

作者：

Munier-Kordon, Alix ^{[1
]}

Rebaine, Djamal ^{[2
]}

机构：

[1] Univ Paris 06, Dept SOC, Lab LIP6, F-75252 Paris 05, France

[2] Univ Quebec Chicoutimi, Dept Informat & Math, Chicoutimi, PQ G7H 2B1, Canada

来源：

OPERATIONS RESEARCH LETTERS | 2014年 / 42卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Coupled operations; Makespan; Special case; Time delays; Worst-case analysis; TASKS;

D O I：

10.1016/j.orl.2013.11.006

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper addresses the problem of scheduling n unit-time coupled operations on m identical parallel machines with minimum time delay considerations so as to minimize the overall completion time, known as the makespan. Two approximation algorithms, along with their worst-case analysis, are presented. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：21 / 26

页数：6