期刊
OPTIMIZATION LETTERS
卷 6, 期 3, 页码 559-569出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-011-0281-7
关键词
Flow shop; Scheduling; Availability constraint; Approximation scheme
In this paper, we develop a polynomial-time approximation scheme for the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据