Semi-online scheduling with known partial information about job sizes on two identical machines

Authors:
Qian Cao;Zhaohui Liu;T. C. E. Cheng
Affiliations:
Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, China;Department of Mathematics, East China University of Science and Technology, Shanghai, China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Theoretical Computer Science
Year:
2011

Citing 6
Cited 1

On the performance of on-line algorithms for partition problems

Acta Cybernetica
Semi on-line scheduling on two identical machines

Computing
Semi-online scheduling problems on two identical machines with inexact partial information

Theoretical Computer Science
Semi on-line algorithms for the partition problem

Operations Research Letters
Semi-online scheduling with decreasing job sizes

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

Operations Research Letters

Several semi-online scheduling problems on two identical machines with combined information

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper we consider the semi-online scheduling problem with known partial information about job sizes on two identical machines, where all the jobs have processing times in the interval [p,tp](p0,t=1) and the maximum job size is tp. The objective is to minimize the makespan. For 1@?t=2, we obtain lower bounds t+12 and 43 on the optimal solution, respectively, which match the upper bounds given by He and Zhang (1999) in [2]. For 43@?t