成组加工中带可分配工期的最大延误问题

下载PDF

导出

摘要研究成组加工中带可分配工期的最大延误问题的排序与工期分配,对于成组加工中带可分配工期的最大延误问题的不同模型,或给出其最优序,或证明其是NP-难问题.

作者严培胜

机构地区湖北经济学院统计与应用数学系

出处《高等数学研究》 2009年第1期22-24,28,共4页 Studies in College Mathematics

关键词成组加工最大延误排序工期分配到达时间分配

参考文献10

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.
9严培胜,邓薇,高成修.成组加工中带可分配工期的误工任务数问题[J].数学杂志,2006,26(4):451-456. 被引量：1
10A. H. G Rinnooy. Kan. Machine scheduling problem [A]. classification, complexity and computation[C]. The Hague . Martnus Nijhoff : 1976. P. 59.

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

高等数学研究

2009年第1期

内容加载中请稍等...