DocumentCode :
493551
Title :
On-Line Scheduling on a Single Bounded Batch Processing Machine with Restarts
Author :
Chen, Hua ; Zhang, Yuan-ping ; Yong, Xue-rong
Author_Institution :
Sch. of Comput. & Commun., Lanzhou Univ. of Technol., Lanzhou
Volume :
1
fYear :
2009
fDate :
7-8 March 2009
Firstpage :
868
Lastpage :
871
Abstract :
The problem of on-line job scheduling on a single batch processing machine with bounded batch size is attacked. Jobs arrive dynamically over time, the characteristics of jobs are unknown before their arrivals. A batch processing machine can handle up to b jobs simultaneously. The processing time of a batch is given by the longest processing time of some job in the batch. The objective of on-line scheduling problem is to minimize the time makespan. An on-line algorithm with restarts for a bounded batch machine scheduling is presented, and it is shown that the competitive ratio is 3/2. This model has not been considered previously.
Keywords :
batch processing (industrial); single machine scheduling; bounded batch machine scheduling; bounded batch size; online job scheduling; single bounded batch processing machine; time makespan; Approximation algorithms; Circuit testing; Computer science; Computer science education; Educational technology; Mathematics; Ovens; Processor scheduling; Scheduling algorithm; Semiconductor device testing; batch machine; bounded; makespan; on-line; restarts; scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-1-4244-3581-4
Type :
conf
DOI :
10.1109/ETCS.2009.196
Filename :
4958901
Link To Document :
بازگشت