| Tekijä: | Alidaee, B. |
| Otsikko: | A heuristic solution procedure to minimize makespan on a single machine with non-linear cost functions |
| Lehti: | Journal of the Operational Research Society
1990 : NOV, VOL. 41:11, p. 1065-1068 |
| Asiasana: | HEURISTIC METHODS SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | A static single-facility scheduling problem is considered, where the processing times of jobs are a non-decreasing and differentiable function of their starting /waiting/ times and the objective is to minimize the total elapsed time /makespan/ in which all jobs complete their processing. A criterion for optimality of two jobs to be scheduled next to each other is given, and based on this criterion a heuristic algorithm to solve the problem is proposed. The effectiveness of the algorithm is empirically evaluated for quadratic and exponential cost functions. |
SCIMA