带货盘流水作业加工全长问题

MINIMIZING MAKESPAN IN FLOWSHOP WITH PALLET REQUIREMENT

下载PDF

导出

作者陈秀宏

机构地区淮阴师范学院数学系

出处《佳木斯大学学报（自然科学版）》 CAS 2003年第3期252-255,共4页 Journal of Jiamusi University：Natural Science Edition

基金 ~~

关键词 flow-shop问题加工全长复杂性货盘流水作业三维匹配强NP-难

参考文献4

1B.Chen,C.N.Pott,G.J.Woeginger、A review of machine scheduling:complexity,algorithms and approximability[M],in:D.Z.Du and P.M.Pardalos(eds).Handbook of combinatorial optimization,Kluwer Academic Publishers,1998。21——169.
2M.R.Garey,and D、S、Johnson,Computers and intractability:a guide to the theory of NP—completeness[M].Freeman.San Francisco,1979.
3E.L.Lawler,J.K.Lenstra.A.H.G.Rinnooy Kan,D.B.Shmoys.Sequencing and scheduling:algorithms and complexity[C]。in:S.Graves,A.H.G.Rinnooy Kan,P.Zipkin(eds.),Handbooks in Operations Research and Management Science,Volume 4:Logistics of Production and Inventory、North--Holland.Amsterdam.1993.445—552.
4M.Wang,S.Sethi.C.Sriskandarajah,and S.V.D.Velde。Minimizing makespan in flowshops with pallet requirements:computational complexity[J:].IFOR.35(1997):277—285.

佳木斯大学学报（自然科学版）

2003年第3期

内容加载中请稍等...