Article ID: | iaor1994966 |
Country: | United Kingdom |
Volume: | 44 |
Issue: | 10 |
Start Page Number: | 991 |
End Page Number: | 1002 |
Publication Date: | Oct 1993 |
Journal: | Journal of the Operational Research Society |
Authors: | Liao C.-J., Liao L.-M. |
Keywords: | programming: dynamic, heuristics |
A number of important contributions have been made toward the problem of minimizing the difference in ‘customer’ treatment on a single machine. However, so far, all the research has been to solve the problem of minimizing the ‘job’ difference. That is, it is assumed implicitly that each customer places only one job, and hence minimizing the difference in customer treatment is equivalent to minimizing the difference in job treatment. In many practical situations, a customer may place an order which consists of several jobs. The jobs usually can be grouped into different classes. Thus, the range, i.e. the difference between the maximum and the minimum, of order completion times becomes an appropriate performance measure for treating customers equally. In this paper, a dynamic programming (DP) algorithm is developed to provide the optimal solution. Due to the exponential time complexity of the DP algorithm, two heuristic methods are also proposed to solve large-sized problems. Computational results for the heuristics are provided.