Single Machine Scheduling to Maximize Total Job Value Subject to Machine Availability Constraint

Abstract

This thesis considers a single machine scheduling problem to maximize total job value subject to machine availability constraint where each job is represented by a nonincreasing stepwise value function. In the analysis, some solution properties are characterized, based on which two solution algorithms including a branch-and-bound algorithm and a heuristic algorithm are derived. Numerical experiments show that the heuristic algorithm is efficient and effective.