Technical Note
Journal of the Operational Research Society (1993) 44, 835–838. doi:10.1057/jors.1993.142
Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
Jerzy Kyparisis1 and Christos Douligeris2
- 1Florida International University, Miami, USA
- 2University of Miami, Coral Gables, USA
Correspondence: J. Kyparisis, Department of Decision Sciences and Information Systems, College of Business Administration, Florida International University, Miami, Florida 33199, USA.
Top of page
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.
Keywords:
Machine Scheduling, Job Selection
