| Article ID: | iaor1997553 |
| Country: | United States |
| Volume: | 43 |
| Issue: | 5 |
| Start Page Number: | 629 |
| End Page Number: | 654 |
| Publication Date: | Aug 1996 |
| Journal: | Naval Research Logistics |
| Authors: | Blocher James D., Chhajed Dilip |
The authors 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. They 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.