Scheduling with Machine Cost
For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. We consider two basic online scheduling problems with the modification that initially the algorithm possesses no machines, but that at any point additional machines may be purchased. Upper and lower bounds on the competitive ratio are shown for both problems.
KeywordsSchedule Problem Time Model Competitive Ratio Online Algorithm Optimal Cost
Unable to display preview. Download preview PDF.
- 1.Albers, S.: Better bounds for online scheduling. In: Proc. 29th Symp. Theory of Computing, pp. 130–139 (1997)Google Scholar
- 2.Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. In: Proc. 8th Symp. On Discrete Algorithms, pp. 609–618 (1997)Google Scholar
- 6.Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)Google Scholar
- 7.Noga, J., Seiden, S.: Scheduling two machines with release times. To appear at Integer Programming and Combinatorial Optimization (1999)Google Scholar