期刊
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
卷 8, 期 1, 页码 87-99出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-009-0102-3
关键词
Flow shop; Scheduling; Availability constraint; Heuristics; Worst case analysis
In this paper, we deal with the two-machine flow shop scheduling problem having an unavailability interval on the first machine, and nonresumable jobs. We first present an enhancement procedure that, once applied to any arbitrary solution, produces a schedule that is at most equal 2 times the optimal makespan. We then develop an improved heuristic, with a relative worst-case error of 3/2.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据