 |
 |
 |
 |
 |
 |
| Application processes job-shop scheduling data: - N tasks on M parallel processors - N tasks on M serial processors Application generates alternative job sequences with the following production objectives: - Minimize Mean Flow Time - Minimize Weighted Mean Flow Time - Minimize Mean Lateness - Minimize Maximum Tardiness - Minimize Number of Tardy Tasks - Minimize Mean Tardiness Application may be used to estimate job-shop performace under expected work loads and alternative resource levels. |
 |
 |
| Proper scheduling can get the same work done at a higher level of productivity: increased resource utilization, decreased in-process inventory, and reduced tardiness. |