Approximations and auctions for scheduling batches on related machines

Authors:
TamáS Kis;RicháRd KáPolnai
Affiliations:
Computer and Automation Research Institute, Kende utca 13-17, 1111 Budapest, Hungary;Budapest University of Technology and Economics, Magyar tudósok körútja 2/d, 1117 Budapest, Hungary
Venue:
Operations Research Letters
Year:
2007

Citing 8
Cited 0

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Analysis of heuristics for preemptive parallel machine scheduling with batch setup times

Operations Research
An approximate truthful mechanism for combinatorial auctions with single parameter agents

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Truthful Mechanisms for One-Parameter Agents

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Algorithmica
Mechanisms for discrete optimization with rational agents

Mechanisms for discrete optimization with rational agents
Fast monotone 3-approximation algorithm for scheduling related machines

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Truthful approximation mechanisms for scheduling selfish related machines

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the scheduling of groups of identical jobs on related machines with sequence independent setup times. We provide a 2-approximation algorithm for minimizing the makespan. The second result is a truthful, polynomial time, randomized mechanism for the batch scheduling problem with a deterministic approximation guarantee of 4.