1 research outputs found
Recommended from our members
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
We consider a range of scheduling problems with controllable processing times, in which the jobs must be completed by a common deadline by compressing appropriately their processing times. The objective is to minimize the maximum compression cost. We present a number of algorithms based on common general principles adapted with a purpose of reducing the resulting running times