NAVAL RESEARCH LOGISTICS, cilt.43, sa.6, ss.929-936, 1996 (SCI-Expanded)
We consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. We develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules. (C) 1996 John Wiley & Sons, Inc.