装卸工问题是从现代物流技术中提出的一个实际问题.这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过.现代物流技术迅速发展,促成和推动装卸工问题的提出和研究.装卸工问题是一个新的NP困难的组合优化问题,首先介绍装卸工问题及限制情况下装卸工问题的数学模型,然后分析限制情况下的装卸工问题的性质,最后给出该问题的所有最优解.
The loader problem is a real problem from the logistics technologies. The embryonic form of the problem was proposed and studied by Institute of Mathematics, the Chinese Academy of Sciences, in 1960's. The rapid developments of the modern logistics technologies motivate the presentation and study of the loader problem. The loader problem is a new NP-hard combinatorial optimization problem. In this paper we firstly introduce the mathematical model of the loader problem and the restricted case of the loader problem, then, analyze the mathematical properties of the problem, and, finally, provides all optimal solutions for the .restricted case of the loader problem.