Article ID Journal Published Year Pages File Type
1135691 Computers & Industrial Engineering 2007 13 Pages PDF
Abstract

We consider single-resource scheduling when candidate jobs may be accepted (producing job-specific profit) or rejected. Our solution approaches seek to maximize the profitability of the resulting schedule under job-specific tardiness costs and reducible processing times (at a cost). We present an algorithm that maximizes schedule profit for a given sequence of jobs, along with two heuristic approaches for generating good job sequences. A set of computational tests on randomly generated problem instances demonstrates the relative effectiveness of our proposed heuristic approaches.

Related Topics
Physical Sciences and Engineering Engineering Industrial and Manufacturing Engineering
Authors
, ,