Single machine scheduling to minimize the absolute maximum lateness with shortening job processing times

被引：0
|
作者：
Huang, Xue [1 ]
机构：
[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Liaoning, Peoples R China
来源：
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2012年 / 33卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Scheduling; Single machine; Time-dependent processing time; Absolute maximum lateness;
D O I：
暂无
中图分类号：
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号：
1205 ; 120501 ;
摘要：
In this paper we consider a single machine scheduling problem with shortening job processing times. The objective is to find a schedule that minimizes the absolute maximum lateness, where the due dates of jobs are a common due date for all jobs. For the cases of common due date is a given constant and a variable, we show that the problem can be solved in polynomial time, respectively.
引用
收藏
页码：645 / 651
页数：7
相关论文
共 50 条
12345