Non-preemptive two-machine open shop scheduling with non-availability constraints

被引：0
|
作者：
J. Breit
G. Schmidt
V. A. Strusevich
机构：
[1] Department of Information and Technology Management,
[2] Saarland University,undefined
[3] D-66041 Saarbrücken,undefined
[4] Germany (e-mail: jb@itm.uni-sb.de),undefined
[5] School of Computing and Mathematical Sciences,undefined
[6] University of Greenwich,undefined
[7] London SE10 9LS,undefined
[8] U.K.,undefined
来源：
Mathematical Methods of Operations Research | 2003年 / 57卷
关键词：
Key words: Open shop scheduling; availability constraints; worst-case analysis;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.
引用
收藏
页码：217 / 234
页数：17
相关论文
共 38 条
1234