Complexity and Algorithms for Two-Stage Flexible Flowshop Scheduling with Availability Constraints，成果详细信息-中国科技论文在线

谢金星

23浏览
0点赞
0收藏
0分享
50下载
0评论
引用

期刊论文

Complexity and Algorithms for Two-Stage Flexible Flowshop Scheduling with Availability Constraints

谢金星， JINXING XIE* AND XIJUN WANG

Computers and Mathematics with Applications 50(2005)1629-1638，-0001，（）：

URL:

摘要/描述

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem.

关键词: Scheduling, Flexible flowshop, Availability constraints, Approximability, Approximation algorithms, Worst-case analysis ，

问答

暂无问题，成为第一个提问者

我要提问全部问题

【免责声明】以下全部内容由[谢金星]上传于[2006年07月25日 00时32分41秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。

我要评论

全部评论 共 0 条

本学者其他成果

同领域成果