On-line scheduling of parallel jobs on two machines

We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case 1 or 2, required for simultaneous processing. The jobs are presented one by one. Upon receiving a job, we must assign the job to a time slot in the schedule before the next job is presented. No re-assignment is allowed. The goal is to minimize the makespan of the final schedule. There is a straightforward algorithm which achieves a competitive ratio of 2. In this paper we show that no on-line algorithm can have

• Type: Journal
• Year: 2008
• Where: JDA
• Authors: Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang
• Keywords: JDA 2008, On-line Scheduling, Parallel Jobs, Simultaneous Processing