Abstract

Emmons considered the problem of sequencing N jobs on a single machine to minimize total flow time with the minimum number of tardy jobs. He proposed an effective branch-and-bound algorithm for this problem. In this paper, we show that Emmons' algorithm can be extended to a more difficult scheduling problem which includes an optimal selection of jobs as well.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call