自动化学报2003，Vol.29Issue(5)：703-708,6.
一类线性加工时间单机调度问题
Single Machine Scheduling with Linear Processing Times
摘要
Abstract
This paper considers the single machine scheduling problem. It is assumed that jobs have the same basic processing time, but the actual processing time of each job grows linearly with its starting time. Based on the analysis of the problem, optimal algorithms are presented for the problems to minimize the sum of earliness penalties subject to no tardy jobs, to minimize the total resource consumption with makespan constraints, and to minimize makespan with the total resource consumption constraints.关键词
调度/单机/提前惩罚/资源约束/最优算法Key words
Scheduling/single machine/earliness penalties/resource constrained/optimal algorithm分类
信息技术与安全科学引用本文复制引用
赵传立,张庆灵,唐恒永..一类线性加工时间单机调度问题[J].自动化学报,2003,29(5):703-708,6.基金项目
Supported by Doctor Thesis Foundation of Northeastern University(200208) （200208）
