学术
摘 要:
研究了工件带到时间的两阶段柔性流水作业的排序问题，基于求解流水作业和平行机问题的算法思想，提出两个相应的近似算法日（R）和H（MRJ’），证明了这两个算法的最坏情况性能比分别为3-1/m和5/2-1/m，讨论了界的紧性，并利用数值模拟以分析算法与最优值的近似性能比．[著者文摘]
文章出处:
《运筹学学报》-2007年11卷3期 -86-94页
分 类 号:
Approximation Algorithms for Two-stage Flexible Flow Shop Scheduling Subject to Release Dates
Wang Hui, Lu Xiwen（Institute of Applied Mathematics of East China University of Science and Technology, Shanghai 200237, China.）
Abstract:
Consider a two-stage flexible flow shop scheduling problem subject to release dates. Based on the idea of solving the flow-shop problem and parallel machine problem, we provide two approximation algorithms H（R） and H（MRJ＇）. The worst-case performance ratios for the two algorithms are proven to be 3 - 1 5 1/ m and 5/2-1/m respectively. We discuss the tightness of the bound and do numerical simulation to analyze the approximation performance ratio between the algorithm and the optimal solution.[著者文摘]
Key words:
Operations research, flexible flow shop, release dates, scheduling, performance ratio
基金资助:
回国人员科研启动基金和校科研基金资助项目.
更多>>免费文章
cqvip.com