Online algorithms for scheduling with machine activation cost on two uniform machines
In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed, the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and the machine activation cost. We design optimal online algorithms with competitive ratio of (2s+1)/(s+1) for every s≥1.
Key wordsOnline algorithm Competitive analysis Uniform machine scheduling Machine activation cost
CLC numberTP393 O223
Unable to display preview. Download preview PDF.
- He, Y., Han, S.G., Jiang, Y.W., 2006. Online algorithms for scheduling with machine activation cost. Asia-Pacific Journal of Operations research, in press.Google Scholar
- Panwalkar, S., Liman, S.D., 2002. Single operation earliness-tardiness scheduling with machine activation cost. IIE Transactions, 34(5):509–513. [doi:10.1023/A:1013539825022]Google Scholar