期刊
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
卷 8, 期 3, 页码 271-280出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-010-0119-7
关键词
Flow shop scheduling; Availability constraint; Heuristics; Worst case analysis; Polynomially solvable case
In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3. We then present a polynomially solvable case.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据