摘要
本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4//Cmax问题,对这类特殊的排序问题,提出一种启发式算法,得到了最差情况下性能指标的严格的界.
This paper deals with the Q4// Cmax problem of the unif0rm parallel processors for the two groups of the jobs with two special purpose machines and two general- purpose machines, presents a heuristic algorithm,and gives a tight bound on the worst- case perfor manc e for this algorithm.
出处
《运筹学学报》
CSCD
1998年第1期64-70,共7页
Operations Research Transactions
关键词
近似算法
专用机
通用机
排序
平行机
Scheduling,Approximate Algorithm,Performance, Multi-Groups of the Jobs,Special-Purpose and General-Purpose Machine