Two-agent scheduling of time-dependent jobs

被引:6
作者
He, Cheng [1 ]
Leung, Joseph Y-T [2 ]
机构
[1] Henan Univ Technol, Sch Sci, Zhengzhou 450001, Henan, Peoples R China
[2] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
关键词
Scheduling; Two agents; Deteriorating jobs; Shortening jobs; Total completion time; Maximum cost; SINGLE-MACHINE; DETERIORATING JOBS; 2; AGENTS; MINIMIZE;
D O I
10.1007/s10878-016-9994-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the problem of scheduling deteriorating jobs or shortening jobs with two agents A and B. We are interested in generating all Pareto-optimal schedules for the two criteria: (1) the total completion time of the jobs in A and the maximum cost of the jobs in B, and (2) the maximum cost of the jobs in A and the maximum cost of the jobs in B. We show that all Pareto-optimal schedules for both problems can be generated in polynomial time, whether the jobs are deteriorating or shortening.
引用
收藏
页码:362 / 377
页数:16
相关论文
共 22 条
[1]   Scheduling problems with two competing agents [J].
Agnetis, A ;
Mirchandani, PB ;
Pacciarelli, D ;
Pacifici, A .
OPERATIONS RESEARCH, 2004, 52 (02) :229-242
[2]  
Agnetis A., 2014, MULTIAGENT SCHEDULIN
[3]   Multi-agent single machine scheduling [J].
Agnetis, Alessandro ;
Pacciarelli, Dario ;
Pacifici, Andrea .
ANNALS OF OPERATIONS RESEARCH, 2007, 150 (01) :3-15
[4]  
Alidaee B, 1999, J OPER RES SOC, V50, P711, DOI 10.2307/3010325
[5]   A multiple-criterion model for machine scheduling [J].
Baker, KR ;
Smith, JC .
JOURNAL OF SCHEDULING, 2003, 6 (01) :7-16
[6]   SCHEDULING DETERIORATING JOBS ON A SINGLE PROCESSOR [J].
BROWNE, S ;
YECHIALI, U .
OPERATIONS RESEARCH, 1990, 38 (03) :495-498
[7]  
Brucker P., 1998, SCHEDULING ALGORITHM, V2nd
[8]   Multi-agent scheduling on a single machine with max-form criteria [J].
Cheng, T. C. E. ;
Ng, C. T. ;
Yuan, J. J. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 188 (02) :603-609
[9]   Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs [J].
Cheng, T. C. E. ;
Ng, C. T. ;
Yuan, J. J. .
THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) :273-281
[10]   A concise survey of scheduling with time-dependent processing times [J].
Cheng, TCE ;
Ding, Q ;
Lin, BMT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) :1-13