Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy |
| |
Authors: | Jerzy Kyparisis Christos Douligeris |
| |
Institution: | 1.Florida International University,Miami,USA;2.University of Miami,Coral Gables,USA |
| |
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: | |
本文献已被 SpringerLink 等数据库收录! |