Approximations and auctions for scheduling batches on related machines

T. Kis, Richárd Kápolnai

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)61-68
Number of pages8
JournalOperations Research Letters
Volume35
Issue number1
DOIs
Publication statusPublished - Jan 2007

Fingerprint

Batch Scheduling
Setup Times
Auctions
Scheduling Problem
Approximation Algorithms
Polynomial time
Scheduling
Approximation algorithms
Approximation
Polynomials
Batch
Makespan
Setup times
Guarantee

Keywords

  • Approximation-algorithms
  • Auctions
  • Batch-scheduling
  • Mechanism design

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modelling and Simulation

Cite this

Approximations and auctions for scheduling batches on related machines. / Kis, T.; Kápolnai, Richárd.

In: Operations Research Letters, Vol. 35, No. 1, 01.2007, p. 61-68.

Research output: Contribution to journalArticle

@article{83d12d257ec04bcea08b2236aa53d4f8,
title = "Approximations and auctions for scheduling batches on related machines",
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.",
keywords = "Approximation-algorithms, Auctions, Batch-scheduling, Mechanism design",
author = "T. Kis and Rich{\'a}rd K{\'a}polnai",
year = "2007",
month = "1",
doi = "10.1016/j.orl.2006.01.005",
language = "English",
volume = "35",
pages = "61--68",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Approximations and auctions for scheduling batches on related machines

AU - Kis, T.

AU - Kápolnai, Richárd

PY - 2007/1

Y1 - 2007/1

N2 - 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.

AB - 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.

KW - Approximation-algorithms

KW - Auctions

KW - Batch-scheduling

KW - Mechanism design

UR - http://www.scopus.com/inward/record.url?scp=33750983634&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750983634&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2006.01.005

DO - 10.1016/j.orl.2006.01.005

M3 - Article

VL - 35

SP - 61

EP - 68

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 1

ER -