An approximation algorithm for parallel machine scheduling with a common server

An approximation algorithm for parallel machine scheduling with a common server

0.00 Avg rating0 Votes
Article ID: iaor20013926
Country: United Kingdom
Volume: 52
Issue: 2
Start Page Number: 234
End Page Number: 237
Publication Date: Feb 2001
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

In this paper we study the scheduling of a given set of jobs on several identical parallel machines tended by a common server. Each job must be processed on one of the machines. Prior to processing, the server has to set up the relevant machine. The objective is to schedule the jobs so as to minimize the total weighted job completion times. We provide an approximation algorithm to tackle this intractable problem and analyze the worst-case performance of the algorithm for the general, as well as a special, case of the problem.

Reviews

Required fields are marked *. Your email address will not be published.