A heuristic which has been applied to assign a common due to a set of n jobs is considered. An explicit error bound for a variation of the heuristic was obtained. The bound shows that the heuristic is asymptotically optimal for large n if the number of machines m and the weight parameters Pdand PTare held constant. The heuristic is effective if the average number of jobs per machine is reasonably large if the weights assigned to tardiness and the due date are not very different.
|Number of pages||4|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|Publication status||Published - 1 Jan 2000|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering