Scheduling problems on two sets of identical machines

Authors:
Csanád Imreh
Affiliations:
University of Szeged, Ápád tér 2., Szeged, Hungary
Venue:
Computing
Year:
2003

Citing 8
Cited 1

The competitiveness of on-line assignments

Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
An online scheduling algorithm for a two layer multiprocessor architecture

Acta Cybernetica
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Online scheduling with general machine cost functions

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the following scheduling problem: We have two sets of identical machines, the jobs have two processing times one for each set of machines. We consider two different objective functions, in the first model the goal is to minimize the maximum of the makespans on the sets, in the second model we minimize the sum of the makespans. We consider the online, semi online and offline versions of these problems.