期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

考虑设备退化维护的医疗调度研究 被引量：3

Study on Patient Scheduling with Medical Device Maintenance and Variable Maintenance Duration
下载PDF
导出
摘要 研究了一台医疗设备环境下,同时考虑固定周期维护且维护时间可变的退化维护,目标函数为最小化滞后医疗检查数量的调度问题,建立其数学模型,并提出了一个基于Moore算法的三阶段动态启发式算法,通过算例证明了算法的有效性。 This paper studies a single medical device scheduling problem with the objective of minimizing the number of tardy examination for a case in which periodic maintenance activities should be performed and the duration of each maintenance activity is variable, i. e. deteriorating maintenance. A mathematical model is developed and a three-phase heuristic based on Moore＇s algorithm is proposed. Finally, the effectiveness of the heuristic is verified by a series of computational experiments
作者 郑震南 吴一帆 董明
机构地区 上海交通大学安泰经济与管理学院 华东理工大学商学院
出处 《工业工程与管理》 CSSCI 北大核心 2013年第2期78-84,共7页 Industrial Engineering and Management
基金 国家自然科学基金资助项目(71131005 71101051) 上海市晨光人才计划资助项目(11CG33) 中央高校基本科研业务资助项目(WN1123001)
关键词 医疗调度 固定周期维护 退化维护 最小化误工数量 patient scheduling periodic maintenance deteriorating maintenance minimizenumber of tardiness
分类号 C931.1 [经济管理—管理学]
  • 相关文献

参考文献16

  • 1Pinedo M Scheduling Theory, Algorithms and Systems[M]. Prentice- Hall, NewJersey, 2002.
  • 2Schmidt G. Scheduling with limited machine availablilty[J]. EuropeanJournal of Operational Research, 2000, 121: 1-15.
  • 3Ma Y. Chu C B, Zuo C R A survey of scheduling with deterministic machine availablilty constraints[J]. Computers &. Industrial Engineering, 2010, 58: 199-211,.
  • 4Yang D L, Hung C L. Hsu CJ, Chern M S. , Minimizing the makespan in a single machine scheduling problem with a flexible maintenance[J].Journal of the Chinese Institute of Industrial Engineers. 2002 .19,63-66.
  • 5王恕,马钦海,关志民.应用模糊移动瓶颈法的门诊患者调度[J].工业工程与管理,2010,15(5):111-114. 被引量：3
  • 6Lee C Y. Lin C S. Single machine flow-time scheduling with scheduled maintenance[J]. Acta Informatica. 1992. 29: 375-382.
  • 7Liao CJ. Chen WJ. Single-machine scheduling with periodic maintenance and nonresumableJobs[J]' Computers &. Operations Research. 2002.30: 1335-1347.
  • 8Low C Y.JiM. Hsu CJ ? Su C T. Minimizing the makes pan in a single machine scheduling problems with flexiable and perioduc maintenance[J]. Applied Mathematics and Computation. 2010. 34: 334-342.
  • 9MooreJ M. An nJob. one machine sequencing algorithm for minimizing the number of lateJobs[J]. Management Science. 1968.15: 102-109.
  • 10Chen WJ. Minimizing number of tardyJobs on a single machine subject to periodic maintenance[J]. Omega. 2009.37, 591-599.

二级参考文献32

  • 1孙叶平,唐万梅,唐国春.Moore-Hodgson算法最优性的新证明[J].重庆师范大学学报（自然科学版）,2007,24(3):4-7. 被引量：12
  • 2Moore J M. An n-job, one machine sequencing algorithm for minimizing the number of late jobs [ J ]. Management Science, 1968. 15 : 102-109.
  • 3Huo Y, Leung J Y-T, Zhao H. Complexity of two dual criteria scheduling problems [ J ]. Operations Research Letters,2007.35 (2) : 211-220.
  • 4Pinedo M. Scheduling:Theory,Algorithms,and Systems [ M]. 2nd edition. New Jersey:Prentice Hall,2002.
  • 5Brucker P. Scheduling Algorithms [ M ].4th edition. Heidelberg:Springer,2004.
  • 6Sidney J B. An extension of Moore's due date algorithm [ A]. Elmaghraby S E. Symposium on the Theory of Scheduling and its Applications [ C ]. Berlin : Springer, 1973. 393-398.
  • 7Kise H, Ibaraki T, Mine H. A solvable case of the one-machine scheduling problem with ready and due times [ J ]. Operations Research, 1978,26 : 121-126.
  • 8Lawler E L,Moore J M. A functional equation and its application to resource allocation and sequencing problems [ J]. Management Science, 1969,16 : 77-84.
  • 9唐国春.A new branch and bound algorithm for minimizing the weighted number of tardy jobs .Annals of Operations Research,1990,24:225-232.
  • 10Lawler E L. Sequencing to minimize the weighted number of tardy jobs [ J ]. Revue d'Automatiquedlnformatique et de Recherche Operationnelle, 1976,5 (S10) : 27-33.

共引文献7

同被引文献19

引证文献3

工业工程与管理
2013年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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