Article ID Journal Published Year Pages File Type
972258 Mathematical Social Sciences 2011 7 Pages PDF
Abstract
► Single machine scheduling problems with a non-renewable financial resource such as money or fuel. ► Complexity results for bottleneck and sum optimization criteria are given. ► Properties of feasible schedules are derived. ► Results for budget scheduling problems with makespan minimization are presented.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
Single machine scheduling problems with financial resource constraints: Some complexity results and properties
Authors
, , ,