加工时间线性递减的链约束单机排序问题  

Single Machine Scheduling Problem with Linear Decreasing Processing Time and Chains Constrains

作　　者：石国春[1] 

机构地区：[1]兰州工业高等专科学校基础学科部,甘肃兰州730050

出　　处：《兰州工业高等专科学校学报》2010年第3期16-18,共3页Journal of Lanzhou Higher Polytechnical College

摘　　要：讨论了工件的加工时间是开工时间的线性递减函数、工件之间有平行链约束的单机排序问题.对于链可中断和不可中断两种情况,给出了极小化总完工时间的最优算法.A group scheduling problem in which the job subject to chains constraints and processing time is a linear decreasing function of starting time was discussed. Under discontinuous chains and continuous chains,a polynomial algorithm of total completion time is given.

关 键 词：单机 排序 链约束 总完工时间 最优算法 

分 类 号：O221.1[理学—运筹学与控制论]