Single machine scheduling problems with financial resource constraints: Some complexity results and properties

What is it about?

Single machine scheduling problems with a non-renewable financial resource such as money or fuel are considered. Complexity results for bottleneck and sum optimization criteria are given. Moreover, properties of feasible schedules are derived and finally,. results for budget scheduling problems with makespan minimization are presented.

Featured Image