A best online algorithm for scheduling on two parallel batch machines
نویسندگان
چکیده
منابع مشابه
Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
This paper deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...
متن کاملOnline Over Time Scheduling on Parallel-Batch Machines: A Survey
Online scheduling is a rapidly developed branch in scheduling theory. In this paper, we present an extensive survey for online over time scheduling on parallel-batch machines. Some open problems are proposed for further research.
متن کاملAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. Each machine can handle an infinite number of jobs as a batch simultaneously. The processing time of a batch is the time required for processing the longest job in the batch. Each job becomes available at its release date, which is not known in advance, and its processing time only becomes k...
متن کاملTimely Responsive Online Scheduling Algorithm for Parallel Batch Processing
Online job scheduling has demonstrated to be a key factor impacting the output performance of batch processing systems. Existing researches either proposed solutions to a single-machine processing system, or focused on minimizing the total job completion time for multiple-machine batch processing systems. Yet the study on the approaches with the objective of minimizing the job delay time on a p...
متن کاملOnline Scheduling on Parallel Machines with Two GoS Levels
This paper investigates the online scheduling problem on parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels. Hence each job and machine are labeled with the GoS levels, and each job can be processed by a particular machine only when the GoS level of the job is not less than that of the mach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.02.011