A note on “minimizing a weighted quadratic function of job lateness in the single machine system” |
| |
Authors: | H.M. Soroush |
| |
Affiliation: | aDepartment of Statistics and Operations Research, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait |
| |
Abstract: | A set of jobs is to be scheduled on a single machine where an idle time is allowed to be inserted before the processing of the first job begins. The objective is to find an optimal sequence that minimizes the weighted sum of a quadratic function of job lateness. Sen et al. [Sen, T., Dileepan, P., Lind, M.R., 1995. Minimizing a weighted quadratic function of job lateness in the single machine system. International Journal of Production Economics 42(3), 237–243] presented a branch-and-bound algorithm for the problem; however, as shown in this note, their algorithm does not work because the branching rule for adjacent jobs is not applicable to non-adjacent jobs. |
| |
Keywords: | Scheduling Single machine Quadratic lateness Idle time Branch and bound |
本文献已被 ScienceDirect 等数据库收录! |
|