Online Machine Scheduling with Family Setups

被引:1
|
作者
Zhang, Lele [1 ]
Wirth, Andrew [1 ]
机构
[1] Univ Melbourne, Dept Mech Engn, Melbourne, Vic 3010, Australia
关键词
Online scheduling; single machine; family setup; SINGLE-MACHINE; JOB CLASSES; TIMES;
D O I
10.1142/S0217595916500275
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of online scheduling a single machine with family setups under job availability. A setup must be scheduled when the next job comes from a different family from the last completed one, if any. The aim is to minimize the total completion time of all jobs. For the special case of identical processing times, we provide a lower bound for the competitive ratio and an online algorithm with its competitive analysis.
引用
收藏
页数:16
相关论文
共 50 条