Optimal semi-online algorithms for scheduling with machine activation cost

Authors:
Shuguang Han;Yiwei Jiang;Jueliang Hu
Affiliations:
Faculty of Science, Zhejiang Sci-Tech University and Department of Mathematics, Zhejiang University, Hangzhou, China;Faculty of Science and Key Laboratory of Advanced Textile Materials and Manufacturing Technology, Ministry of Education, Zhejiang Sci-Tech University, Hangzhou, China;Faculty of Science, Zhejiang Sci-Tech University, Hangzhou, China
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 7
Cited 0

Semi on-line scheduling on two identical machines

Computing
Scheduling with Machine Cost

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Better Online Algorithms for Scheduling with Machine Cost

SIAM Journal on Computing
Preemptive online algorithms for scheduling with machine cost

Acta Informatica
Parallel machine selection and job scheduling to minimize machine cost and job tardiness

Computers and Operations Research
Semi on-line algorithms for the partition problem

Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the following two semi-on-line scheduling problems with machine activation cost. We are given two potential identical machines to non-preemptively 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 activation cost of machines. For the first semi-on-line problem with known the sum size of all jobs P in advance, we present an semi-on-line algorithm which is optimal for every P 0. For the second problem with known the largest size of all jobs L in advance, we present an optimal semi-on-line algorithm for every L 0.