摘要
装卸工问题是从现代物流技术中提出的一个实际问题,这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过。现代物流业的迅速发展,促成和推动装卸工问题的提出和研究。装卸工问题是一个新的NP困难的组合优化问题,本文研究限制情形下的装卸工问题,并证明是拟多项式时间可解的。
The loader problem is a real problem from the logistics technology. The embryonic form of the problem was proposed and studied by Institute of Mathematics, Acadamia Sinica, in 1960＇s. The rapid development of the modern logistics technology motivates the presentation and study of the loader problem. The loader problem is a new NP-hard combination-optimization problem. In this paper we provide a restricted case of the loader problem and prove that it is psuedo-polynomially solvable.
出处
《运筹与管理》
CSCD
2005年第4期15-18,共4页
Operations Research and Management Science
基金
国家自然科学基金资助项目(10371071)
关键词
运筹学
装卸工问题
NP困难
拟多项式时间可解
限制情况
operations research
loader problem
NP hard
psuedo-polynomially solvable
restricted case
