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

Scheduling deteriorating jobs with rejection on dominant machines

工件加工时间退化且可拒的带优势关系流水作业问题的动态规划算法(英文)
在线阅读 下载PDF
导出
摘要 The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied.The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty.For each objective, polynomial time algorithms based on dynamic programming were presented. The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied. The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty. For each objective, polynomial time algorithms based on dynamic programming were presented.
作者 程予绍 孙世杰
机构地区 Department of Mathematics
出处 《Journal of Shanghai University(English Edition)》 CAS 2008年第6期471-474,共4页 上海大学学报（英文版）
关键词 SCHEDULING deteriorating jobs REJECTION permutation flow shop dominant machines 机械制造 动态性 运算法则 车床加工 动力学
分类号 O221.3 [理学—运筹学与控制论]
  • 相关文献

参考文献11

  • 1Han Hoogeveen,Martin Skutella,Gerhard J. Woeginger.Preemptive scheduling with rejection[J].Mathematical Programming (-).2003(2-3)
  • 2Cheng M B,,Sun S J,He L M.Flow shop schedul- ing problems with deteriorating jobs on no-idle dom- inant machines[].European Journal of Operational Research.2007
  • 3PINEDO M.Scheduling Theory,Algorithms,and Systems[]..2002
  • 4Gupta J N D,Gupta S K.Single facility scheduling with nonlinear processing times[].Computers and Industrial Engineering.1988
  • 5Alidaee B,Womer N K.Scheduling with time dependent processing times: Review and extensions[].Journal of the Operational Research Society.1999
  • 6CHENG T C E,DING Q,LIN B M T.A concise survey of scheduling with time-dependent processing times[].European Journal of Operational Research.2004
  • 7Kononov A.Combinatorial complexity of scheduling jobs with simple linear deterioration[].Discrete Anal Operation Research.1996
  • 8Kononov,A.,Gawiejnowicz,S.NP-hard cases in scheduling deteriorating jobs on dedicated machines[].Journal of the Operational Research Society.2001
  • 9Mosheiov,G.Complexity analysis of job-shop scheduling with deteriorating jobs[].Discrete Applied Mathematics.2002
  • 10Y.Bartal,S.Leonardi,A.Marchetti-Spaccamela,J.Sgall,L.Stougie.Multiprocessor scheduling with rejection[].Proceedings of the th Annual ACM-SIAM Symposium on Discrete Algorithms.1996
Journal of Shanghai University(English Edition)
2008年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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