A note on ‘Minimizing a quadratic function of job lateness on a single machine’

A note on ‘Minimizing a quadratic function of job lateness on a single machine’

0.00 Avg rating—0 Votes
Article ID: iaor19941452
Country: Netherlands
Volume: 32
Issue: 2
Start Page Number: 185
End Page Number: 187
Publication Date: Sep 1993
Journal: International Journal of Production Economics
Authors:
Keywords: programming: branch and bound, heuristics
Abstract:

N jobs are to be scheduled on a single machine in such a way that a quadratic function of job lateness is minimized. Gupta and Sen developed a branch-and-bound algorithm and a heuristic rule to get an optimal and a near-optimal solution, respectively. This note shows that neither of these algorithms works, because of the possible presence of time gaps between jobs in an optimal schedule.

Reviews

Required fields are marked *. Your email address will not be published.