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

具有学习效应的两台机器流水作业排序问题 被引量：1

Flow-shop Scheduling of Two Machines with Learning Effect
下载PDF
导出
摘要 讨论了具有学习效应的2台机器流水作业排序问题,目标函数为极小化总完工时间。首先证明了2个相关引理,基于2个引理和对问题的分析,证明了用SPT算法解决问题的界为一个与工件的最小加工时间和最大加工时间相关的且小于2的一个值。 The paper is discussing flow-shop scheduling of two machines with a learning effect. The objective is to minimize the total completion time. We first prove two related lemmas, then according to the two lemmas and the analysis of the problem, we prove the worst-case bound of SPT algorithm is related to the minimum and maximum processing time of all operations with learning effect, and the number is less than 2.
作者 唐英梅 赵传立
机构地区 沈阳师范大学数学与系统科学学院
出处 《沈阳师范大学学报（自然科学版）》 CAS 2009年第2期141-143,共3页 Journal of Shenyang Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(10471096)
关键词 排序 流水作业 学习效应 总完工时间 scheduling flow-shop learning effect total completion time
分类号 O223 [理学—运筹学与控制论]
  • 相关文献

参考文献8

  • 1BISKUP D. Single-machine scheduling with learning considerations [ J ]. European Journal of Operational Research, 1999,115(1) : 173-178.
  • 2MOSHEIOV G. Scheduling problems with a learning effect[J ]. European Journal of Operational Research, 2001,132 (3) :687-693.
  • 3MOSHEIOV G. Parallel machine scheduling with a learning effect [ J ]. Journal of the Operational Research Society, 2001,52(4) : 1165-1169.
  • 4HOOGEVEEN J A, KAWAGUCHI T. Minimize Total Completion Time in A Two-machine Flow-shop: Analysis of Special Cases[J]. Mathematics of Operations Research, 1999,24(4):887-910.
  • 5赵又里,赵传立.一类具有学习效果的单机排序问题[J].沈阳师范大学学报（自然科学版）,2006,24(2):129-131. 被引量：2
  • 6MOSHEIOV G, SIDNEY J B. Scheduling with general job-dependent learning curves [ J ]. European Journal of Operational Research, 2003,147 (3) : 665-670.
  • 7WANG Jibo, CHENG T C E. Scheduling problem with the effects of deterioration and leaming[J ]. Asia-Pacific Journal of Operational Researeh, 2007,24(2) :1-17.
  • 8WANG Jibo, XIA Zunquan. Flow-shop scheduling with a learning effect[J]. Journal of the Operational Research Society, 2005,56 ( 11 ) : 1325-1330.

二级参考文献6

  • 1BISKUP D. Single machine scheduling with learning considerations [J]. European Journal of Operational Research,1999,115:173-178.
  • 2MOSHEIOV G. Scheduling problems with a learning effect[J]. European Journal of Operational Research, 2001,132:687-693.
  • 3MOSHEIOV G. Parallel machine scheduling with a learning effect[J]. Journal of the Operational Research Society,2001,52:1165-1169.
  • 4CHENG T C E, WANG Guoqing. Single machine scheduling with learning effect considerations[J]. Annals of Operations Research, 2000,98: 273-290.
  • 5PANWALKAR S S, SMITH M L, SEIDMANN A. Common due date assignment to minimize total penalty for the one machine scheduling problem[J]. Operations Research, 1982,30(2) :391-399.
  • 6BAGCHI U B. Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems[J]. Operations Research, 1989,37(1) : 118-125.

共引文献1

同被引文献9

  • 1BISKUP D. Single-machine scheduling with learning considerations[J ]. European Journal of Operational Research, 1999,115(1) : 173-178.
  • 2KOULAMAS C, KYPARISIS G J. Single-machine and two-machine flowshop ,scheduling with general leaning functions [J]. European Journal of Operational Research, 2007,178(2):402-407.
  • 3WU Chin-chia, LEE Wen-chiung. Single-machine scheduling problems with a learning effect[J]. Applied Mathematical Modelling, 2007,32 (7) : 1191-1197.
  • 4KOULAMAS C, KYPARISIS G J. Single-machine scheduling problems with past-sequence-dependent setup times[J]. European Journal of Operational Research, 2008,187(3) :68-72.
  • 5BISKUP D, HERRMANN J. Single-machine scheduling against due dates with past-sequence-dependent setup times [J]. European Journal of Operational Research, 2008,191(2) :587-592.
  • 6KUO Wen-hung, YANG Dar-li. Single-machine scheduling problems with past-sequence-dependent setup times and learning effects[J]. Information Processing Letters, 2007,102(1):22-26.
  • 7KUO Wen-hung, YANG Dar-li. Minimizing the total completion time in a single-machine scheduling problems with a time-dependent learning effect[J ]. European Journal of Operational Research, 2006,174 (2) : 1184-1190.
  • 8WANG Jibo. Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effects[J ]. Computers and Industrial Engineering, 2008,55 (3) : 584-591.
  • 9GRAHAM R L, LAWLER E L, LENSTRA J K, et al. Optimization and approximation in deterministic .sequencing and scheduling[J ]. Annals of Discrete Mathematics, 1979,5 ( 1 ) : 287-326.

引证文献1

二级引证文献2

沈阳师范大学学报（自然科学版）
2009年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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