Article ID: | iaor19932199 |
Country: | United Kingdom |
Volume: | 44 |
Issue: | 2 |
Start Page Number: | 125 |
End Page Number: | 132 |
Publication Date: | Feb 1993 |
Journal: | Journal of the Operational Research Society |
Authors: | Alidaee B. |
Keywords: | heuristics |
This paper is concerned with the problem of sequencing a given set of jobs without preemption on a single machine so as to minimize total cost, where associated with each job is a processing time and a differentiable cost function defined on the completion time of the job. The problem, in general, is NP-complete and, therefore, there is unlikely to be an algorithm to solve the problem in reasonable time, thus a heuristic algorithm is desirable. The paper presents two heuristic algorithms to solve the problem. The first algorithm is based on the differential of the cost functions, and the second algorithm is based on the least square approximation of the cost functions. Computational experiences for the case of quadratic, cubic, and exponential cost functions are presented.