期刊文献+

带有学习效应和恶化工件的双代理调度问题 被引量:9

Two-agent scheduling with a learning effect and deteriorating jobs
下载PDF
导出
摘要 研究带有时同相关的学习效应和恶化工件的双代理单机调度问题,目的是找到一个调度使得满足第二个代理的最大完工时间不超过一个给定的上界的约束下,第一个代理的总完工时间最小.对于该调度问题,给出了一些最优性质,并提出了多项式时间最优算法. This paper investigates the two-agent single-machine scheduling problem with a time-dependent learning effect and deteriorating jobs. The objective is to minimize the total completion time of the first agent with the restriction that the makespan of the second agent does not exceed a given upper bound. The optimal properties are given, and the optimal polynomial time algorithm is presented to solve the scheduling problem.
出处 《系统工程学报》 CSCD 北大核心 2012年第6期841-846,共6页 Journal of Systems Engineering
基金 国家自然科学基金资助项目(71001074) 辽宁省教育厅科学基金资助项目(W2010302)
关键词 调度 双代理 时间相关的学习效应 恶化工件 单机 scheduling two-agent time-dependent learning effect deteriorating jobs single machine
  • 相关文献

参考文献15

  • 1Agnetis A, Mirchandani P B, Pacciarelli D, et al. Scheduling problems with two competing agents[J]. Operations Research, 2004, 52(2): 229 - 242.
  • 2Baker K R, Smith J C. A multiple-criterion model for machine scheduling[J]. Journal of Scheduling, 2003, 6(1): 7-16.
  • 3Leung J Y T, Pinedo M, Wan G. Competitive two-agent scheduling and its applications[J]. Operations Research, 2010, 58(2): 458- 469.
  • 4Mor B, Mosheiov G. Scheduling problems with two competing agents to minimize minmax and minsum earliness measures[J]. European Journal of Operational Research, 2010, 206(3): 540-546.
  • 5Nong Q Q, Cheng T C E, Ng C T. Two-agent scheduling to minimize the total cost[J]. European Journal of Operational Research, 2011, 215(1): 39-44.
  • 6Yin Y Q, Cheng S R, Wu C C. Scheduling problems with agents and a linear non-increasing deterioration to minimize earliness penalties[J]. Information Sciences, 2012, 189(2): 282-292.
  • 7Kuo W H, Yang D L. Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect[J]. European Journal of Operational Research, 2006, 174(2): 1184-1190.
  • 8Wang J B, Ng C T, Cheng T C E, et al. Single-machine scheduling with a time-dependent learning effect[J]. International Journal of Production Economics, 2008, 111(2): 802-811.
  • 9Wang J B. Single-machine scheduling with a time-dependent learning effect and deteriorating jobs[J]. Journal of the Operational Research Society, 2009, 60(4): 583-586.
  • 10Wang L Y, Wang J B, Wang D, et al. Single-machine scheduling with a sum-of-processing-times-based learning effect and deterio- rating jobs[J]. International Journal of Advanced Manufacturing Technology, 2009, 45(3/4): 336-340.

二级参考文献11

  • 1Agnetis A, Mirchandani P B, Pacciarelli D, et al. Scheduling problems with two competing agents[J]. Operations Research, 2004, 52 (2): 229 - 242.
  • 2Baker K R, Smith J C. A multiple-criterion model for machine scheduling[J]. Journal of Scheduling, 2003, 6 (1): 7 - 16.
  • 3Cheng T C E, Ng C T, Yuan J J. Multi-agent scheduling on a single machine with max-form criteria[J]. European Journal of Opera- tional Research, 2008, 188 (2): 603 - 609.
  • 4Agnetis A, Pascale G, Pacciarelli D. A Lagrangian approach to single-machine scheduling problems with two competing agents[J]. Journal of Scheduling, 2009, 12 (4): 401 - 415.
  • 5Liu P, Tang L X, Zhou X Y. Two-agent group scheduling with deteriorating jobs on a single machine[J]. International Journal of Advanced Manufacturing Technology, 2010, 47 (5/8): 657 - 664.
  • 6Ng C T, Cheng T C E, Bachman A, et al. Three scheduling problems with deteriorating jobs to minimize the total completion time[J]. Information Processing Letters, 200-2, 81 (6): 327 - 333.
  • 7Ho K I J, Leung J Y T, Wei W D. Complexity of scheduling tasks with time-dependent execution times[J]. Information Processing Letters, 1993, 48 (6): 315- 320.
  • 8Wang J B, Liu L L. Two-machinb flowshop scheduling with linear decreasing job deterioration[J]. Computers and Industrial Engineering, 2009, 56 (4): 1487 - 1493.
  • 9Wang J B. A note on single-machine scheduling with decreasing time-dependent job processing times[J]. Applied Mathematical Modelling, 2010, 34 (2): 294 - 300.
  • 10Graham R L, Lawler E L, Lenstra J K, et al. Optimization andapproximation in deterministic sequencing and scheduling theory: A survey[J]. Annals of Discrete Mathematics, 1979, 5 (2): 287 - 326.

共引文献7

同被引文献137

引证文献9

二级引证文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部