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

成组加工中带可分配工期的误工任务数问题 被引量：1

SINGLE MACHINE SCHEDULING WITH ASSIGNABLE DUE DATES TO NUMBER OF TARDY TASKS IN BATCH PROCESSING
下载PDF
导出
摘要 本文研究了成组加工时带可分配工期的误工任务数问题的排序与工期分配.对于成组加工中带可分配工期的误工任务数问题的不同模型,或给出其最优序,或证明了其是NP-难问题. In this paper, we discuss single machine scheduling with assignable due dates to minimize number of tardy tasks in batch processing. For all these models, we either give the optimal schedules, or prove that they are NP-hard questions.
作者 严培胜 邓薇 高成修
机构地区 湖北经济学院经济信息系 武汉大学数学与统计学院
出处 《数学杂志》 CSCD 北大核心 2006年第4期451-456,共6页 Journal of Mathematics
基金 国家自然科学基金资助项目(70471034 A0324666)
关键词 成组加工 误工任务数 排序 工期分配 到达时间分配 processed in batches number of tardy tasks scheduling assignment of due dates assignment of arrival time
分类号 O223 [理学—运筹学与控制论]
  • 相关文献

参考文献9

  • 1Cheng T.C.E.,Gupta M.C..Survey of scheduling research involving due-date assignment on a single machine[J].Discrete Applied Mathematics,1996,70:156-166
  • 2Hall N.G.,Scheduling problems with generalized due dates[J].IIE Trans,1986,18:220-222.
  • 3Sriskandarajah C..A note on the generalized due dates scheduling problems[J].Naval Research Logistics,1990,37:587-597.
  • 4Hall N.G.,Sethi S.P.,Sriskandarajah C..On the complexity of generalized due dates scheduling problems[J].European J.Oper.Res,1991,51:100-109.
  • 5Tanaka K.,Vlach M..Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates[J].IEICE Trans.Fundamentals,1997,80:557-563.
  • 6Tanaka K.,Vlach M..Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine[J].Annals of Oper.Res,1999,86:507-526.
  • 7Gordon V.,Kubiak W..Single machine with release and due date assignment to minimize the weighted number of late jobs[J].Information Processing Letters,1998,68:153-159.
  • 8Qi.Xingtong,Yu Gang,Bard J.Single Machine Scheduling with Assignable Due Dates[J].Discrete Applied Mathematics,2002,122:211-233.
  • 9Rinnooy A.H.G..Machine scheduling problem:classification.complexity and computation[C].The Hague,Martinus Nijhoff:1976.P.59

同被引文献9

  • 1T. C. E. Cheng and M. C. Gupta. Survey of scheduling research involving due - date assignment on a single machine[J]. Discete Applied Mathematics, 1996,70 : 156- 166.
  • 2N. G. Hall. Schduling problems with genealizde due dates [J]. IIE Trans ,1986,18 : 220- 222.
  • 3C. Sriskandarajah. A note on the generalized due dates scheduling problems [J]. Naval Research Logistics, 1990,37 : 587-597.
  • 4N. G. Hall,S. P. Sethi and C. Sriskandarajah. On the complexity of generaliazde due dates scheduling problems [J]. European J. OPer. Res, 1991,51 : 100 - 109.
  • 5K. Tanaka and M. Vlach. Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates [J]. IEICE Trans. Fundamentals , 1997,80 : 557- 563.
  • 6K. Tanaka and M. Vlach. Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine [J]. Annals of Oper . Res, 1999,86 : 507 - 526.
  • 7V. Gordon and W, Kubiak. Single machine with release and due date assignment to minimize the weighted numbe of lae jobs [J]. Information Processing Letdters, 1998,68 : 153 - 159.
  • 8Qi, X, G. Yu,and J,Bard. Single Machine Scheduling with Assignable Due DAtes [J]. Discrete Applied Mathem aries,2002,122 : 211 - 233.
  • 9A. H. G Rinnooy. Kan. Machine scheduling problem [A]. classification, complexity and computation[C]. The Hague . Martnus Nijhoff : 1976. P. 59.

引证文献1

数学杂志
2006年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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