摘要
阐述了现代物流技术中装卸工人调配问题、装卸工问题、限制情况下装卸工问题及其数学模型,证明了装卸工人调配问题与限制情况下装卸工问题的数学模型是等价的.通过分析装卸工人调配问题的数学性质得出该问题的一种新解法并给出其证明.新解法给出了该问题的所有最优解.
The loader scheduling problem, the loader problem, the restricted case of the loader problem and their mathematical models are introduced. A proof that the loader scheduling problem and the restricted case of the loader problem have the same optimal solutions is provided. The mathematical properties of the loader scheduling problem are analysed and all optimal solutions for the loader scheduling problem are presented.
出处
《上海理工大学学报》
EI
CAS
北大核心
2007年第2期145-148,共4页
Journal of University of Shanghai For Science and Technology
基金
国家自然科学基金资助项目(70471065)
上海市教委科技发展基金资助项目(05EZ31)
上海市重点学科建设资助项目(T0502)
关键词
装卸工人调配问题
装卸工问题
整数规划
最优解
loader scheduling problem
loader problem
integer program
optimal solution
