Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates

► We consider single-machine scheduling with fixed delivery dates. ► The delivery dates are given or determined before the jobs are processed. ► The objective is to minimize the total weighted flowtime of the jobs. ► The heuristic applies the largest ratio first rule to schedule the jobs. ► We investigate the performance bounds of the heuristic.