Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

Abstract

Most scheduling research has treated individual job processing times as fixed parameters. In many practical situations, however, a manager may exert processing time control through the allocation of a limited resource. We consider the problem of joint sequencing and resource allocation when the scheduling criterion of interest is the number of tardy jobs. Theoretical results are derived that aid in developing the tradeoff curve between the number of tardy jobs and the total amount of allocated resource.