期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 59, 期 2, 页码 352-361出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2010.03.013
关键词
Cyclic scheduling problems; Complexity; Reducibility; Robotic scheduling
资金
- Hong Kong Polytechnic University [G-U720]
- Spanish Government [MTM2007-60928, MTM2009-08830]
- European Funds for Regional Development
In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flow-shop, and cyclic project scheduling problems. We present state-of-the-art results on the computational complexity of the problems, paying special attention to recent results on the unsolvability (NP-hardness) of various cyclic problems arising from the scheduling of robotic cells. (c) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据