Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个NP问题。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
应用推荐