One machine sequencing to minimize mean flow time with minimum number tardy |
| |
Authors: | Hamilton Emmons |
| |
Abstract: | The problem of sequencing n jobs on one machine is considered, under the multiple objective of minimizing mean flow time with the minimum number of tardy jobs. A simple procedure is first proposed to schedule for minimum flow time with a specified subset of jobs on time. This is used in conjunction with Moore's Algorithm in a simple heuristic producing good and often optimal schedules. A branch-bound algorithm is presented to produce the optimal schedule efficiently with the help of several theorems which eliminate much branching. |
| |
Keywords: | |
|
|