Ordinal Semi On-Line Scheduling for Jobs with Arbitrary Release Times on Identical Parallel Machines

In this paper, we investigate the problem of semi-on-line scheduling n jobs on m identical parallel machines under the assumption that the ordering of the jobs by processing time is known and the jobs have arbitrary release times. Our aim is to minimize the maximum completion time. An ordinal algorithm is investigated and its worst case ratio is analyzed.


Introduction
The problem of minimizing the maximum completion time for scheduling n jobs on m identical parallel machines (which is denoted by attracted the interests of many researchers since it was proposed by Graham in 1969 [1].The problem is defined as follows: Given a job set , , , n L J J J =  of n jobs and an identical parallel machine set { } , where job j J has non-negative processing time j p , assign the jobs onto the machines so as to minimize the maximum completion of the m machines. A scheduling problem is called off-line if we have complete information about the job data before constructing a schedule.In contrast, the scheduling problem is called online if the jobs appear one by one and it requires scheduling the arriving job irrevocably on a machine without knowledge of the future jobs.The processing time of next job becomes available only after the current job is scheduled.Graham [1] proposed the List Scheduling (LS) algorithm to minimize the Li and Huang [2] generalized Graham's classical on-line scheduling problem to m identical machines.They describe the requests of all jobs in terms of order.
For an order of the job j J , the scheduler is informed of a 2-tuple ( ) where j r and j p represent the release time and the processing time of the job j J , respectively.The orders of request have no release time but appear online one by one at the very beginning time of the system.In this online situation, the jobs' release times are assumed to be arbitrary.If all jobs' release times are zero, then the problem in Li and Huang [2] becomes the same as the Graham's classical on-line scheduling problem.
For the classical online problem on the identical parallel machine system, we know that no algorithm can be better than algorithm LS when the number of machines is less than 4. In many applications, partial information about jobs can be made available in advance.This motivates us to study semi-online scheduling problems when different types of partial information become available [3].He and Zhang [4], and He and Dosa [5] consider the system when the lengths of all jobs are known in [ ] 1, r with 1 r ≥ .See Cheng et al. [6]; Li and Huang [7]; Seiden et al. [8]; Li et al. [9] for more recent results on semi-online scheduling.
Liu et al. [10] firstly considered ordinal semi-online problem in which it is assumed that the values of the processing times j p are unknown, but that the order of the jobs by non-increasing processing time is known, i.e., The rest of the paper is organized as follows.In Section 2, some definitions and the algorithm P are given.In Section 3, we analyze the algorithm P and show its the upper bound of the worst case ratio.In Section 4, we give some concluding remarks.

Some Definitions and the Algorithm P
In this section we will give some definitions and an algorithm P.
as the worst case performance ratio of algorithm A .Definition 2. Suppose that j J is the current job with information ( ) , j j r p , i.e., release time j r and size of j p , to be scheduled on machine i M .We say that machine i M has an idle time interval for job j J , if there exists a time in- , T T satisfying the following two conditions: , T T and a job with release time 2 T has been assigned to machine i M to start at time 2 T . 2) It is obvious that if machine i M has an idle time interval for job j J then we can assign j J to machine i M in the idle interval.
The algorithm P: assign jobs of L one by one on machine ( )   holds, we assign the following jobs on machine holds, we assign the following jobs on machine Assignment example for 5 m = : The above assignment just means the order of the job's assigning, not mean the order of job's processing because of the release times of the jobs.For example on machine J begin to be processed at time zero and 1 J begin to be processed at 6 even though 1 J is assigned before 10 J because 1 J appears before 10 J .
The following symbols will be used in the analysis of this paper later on: 2) i U : the total sum of the idle time on machine i M in the schedule P.  1) [ ] i h : the index of the h-th job assigned on machine i M in the schedule P.
2) x     : It represents the smallest integer not less than x.
3) x     : It represents the largest integer not bigger than x.

Main Results
The following simple inequality will be referred to later on: ( ) , Firstly we prove the following statement by induction for h : For That means the statement is true for h = 2. Now suppose (1) holds for h = k, i.e., where the last equality results from [ ] = by the rules of algorithm P. The claim is proved.
Lemma 2: For any job list By the rules of P we have , by Lemma 1 when m is even and 1 i m ≤ ≤ we have ( ) , by Lemma 1, when m is odd and 1 1 2 ( ) ) where the last inequality results from the fact that ( ) 1 1 where the last inequality results from the fact that ( ) Case 3: m is odd and 1 2 By the above conclusions, when m is even we have

Concluding Remarks
In this paper, we consider the semi-online scheduling problem ( ) max / ordinal, / m i P r C in which the job list has non-increasing processing times and arbitrary release times.An algorithm is investigated and it is shown that its worse case performance ratio is bounded by ( ) for all values of m.For this problem, to investigate better algorithms or give lower bound and upper bound would be worth doing.There are many other scheduling problems where ordinal algorithms could be developed.The investigations to find good algorithms for these problems would be also of interest to the scheduling community.

1 M
= , then 10 Hence the theorem is proved.
Ji et al.
Ji et al.