The customer order lead‐time problem on parallel machines
研究了在并行处理器上调度客户订单（每个订单包含一个或多个作业）以最小化平均订单完成时间的问题，提出了简单直观的启发式方法，并给出了下界证明其有效性。
We consider the problem of scheduling customer orders, each consisting of one or more individual jobs, on a set of parallel processors with the objective of minimizing average order completion time. We provide simple intuitive heuristics to guide managers in this environment and introduce lower bounds that show that these heuristics are effective for a wide variety of problems. © 1996 John Wiley & Sons, Inc.