Single machine scheduling and selection to minimize total flow time with minimum number tardy

Single machine scheduling and selection to minimize total flow time with minimum number tardy

0.00 Avg rating—0 Votes
Article ID: iaor1994608
Country: United Kingdom
Volume: 44
Issue: 8
Start Page Number: 835
End Page Number: 838
Publication Date: Aug 1993
Journal: Journal of the Operational Research Society
Authors: ,
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 and proposed an effective branch-and-bound algorithm for this problem. In this paper, the authors show that Emmons’ algorithm can be extended to a more difficult scheduling problem which includes an optimal selection of jobs as well.

Reviews

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