Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach

This paper considers minimizing the sum of the weighted squares of lateness values for all jobs scheduled in a single machine system. In many real world hobshop scheduling situations, early completions of jobs are as undesirable as tardy completions. In such cases, minimization of the sum of squared lateness values of jobs may be an appropriate objective for the decision maker. Also, lateness of one job may be more or less expensive than the lateness of another job. In those situations, it is reasonable to consider different penalties for the lateness research considers minimizing the sum of the weighted squared lateness values of jobs in the schedule. A branch-and-bound technique is presented to find an optimal solution. Computational results are also reported.