Competitive Online Scheduling with Level of Service
نویسندگان
چکیده
Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.
منابع مشابه
Online Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملTrucks Scheduling to Reduce Delays in Multiple Cross-Docks Using Imperialist Competitive Algorithm
Cross docking is a logistics strategy that is now used by a large number of firms in the various industries. Cross docking effectively a significant reduction in transport costs, without increasing inventory and at the same time maintain the level of service to customers. It also can cross dock order to reduce cycle time, improve flexibility and responsiveness lead distribution network. In this...
متن کامل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...
متن کاملOnline Scheduling for Sorting Buffers
We introduce the online scheduling problem for sorting buffers. A service station and a sorting buffer are given. An input sequence of items which are only characterized by a specific attribute has to be processed by the service station which benefits from consecutive items with the same attribute value. The sorting buffer which is a random access buffer with storage capacity for k items can be...
متن کاملSemi-online scheduling problems on two uniform machines under a grade of service provision
In this talk, we discuss semi-online scheduling on two uniform machines under a grade of service (GoS) provision, where one machine with speed one can process all jobs, and the other machine with speed s (s>0) can only process some jobs. The objective is to minimize the makespan. We consider two variants, where the total size of jobs or the optimal makespan is known in advance. For both variant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Scheduling
دوره 6 شماره
صفحات -
تاریخ انتشار 2001