Scheduling;
Single machine;
Time-dependent processing times;
Parallel chains;
Series-parallel graph;
WEIGHTED COMPLETION-TIME;
SIMPLE LINEAR DETERIORATION;
MAXIMUM LATENESS;
PARALLEL MACHINE;
RELEASE TIMES;
JOBS;
COMPLEXITY;
MINIMIZE;
COSTS;
TASKS;
D O I:
10.1007/s00170-009-2089-5
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
In this paper we consider single-machine scheduling problems with decreasing start-time-dependent processing times, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraint, respectively. It is shown that, for the problems of minimization of the total weighted completion time, polynomial algorithms exist.
机构:
Ming Chi Univ Technol, Dept Ind Engn & Management, New Taipei 24301, TaiwanMing Chi Univ Technol, Dept Ind Engn & Management, New Taipei 24301, Taiwan
Kuo, Yiyo
Chen, Sheng-, I
论文数: 0引用数: 0
h-index: 0
机构:
Natl Chiao Tung Univ, Dept Ind Engn & Management, Hsinchu 300, TaiwanMing Chi Univ Technol, Dept Ind Engn & Management, New Taipei 24301, Taiwan
Chen, Sheng-, I
Yeh, Yen-Hung
论文数: 0引用数: 0
h-index: 0
机构:
Ming Chi Univ Technol, Dept Ind Engn & Management, New Taipei 24301, TaiwanMing Chi Univ Technol, Dept Ind Engn & Management, New Taipei 24301, Taiwan
机构:
Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
Cheng, TCE
Ding, Q
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China