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.

• 装卸工问题是一个新的NP困难的组合优化问题，本文研究限制情形下的装卸工问题，并证明是拟多项式时间可解的。