Approximation algorithms for scheduling unrelated parallel machines
نویسندگان
چکیده
منابع مشابه
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
This paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-rela....<ation or to a convex quadratic programming relaxation. We also investigate ...
متن کاملEfficient Approximation Algorithms for Scheduling Unrelated Parallel Machines
Scheduling n independent jobs on m Unrelated Parallel Machines (SUM) is the problem of assigning n jobs j = 1, .., n to m machines i = 1, .., m so that each job is processed without interruption on one of the machines, and at any time, every machine processes at most one job. The objective is to minimize the makespan of the schedule. SUM is an NP-hard problem even when the number of machines is...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملRandomized Approximation Schemes for Scheduling Unrelated Parallel Machines
The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed, and randomized fully linear time approximation schemes are shown for both of them. While matching the...
متن کاملA Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines
We consider the problem of scheduling n independent jobs on m unrelated parallel machines without preemption. Job i takes processing time pi j on machine j , and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize makespan. The best known approximation algorithms for this problem compute an optimum fractional solution and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1990
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01585745