Approximations and auctions for scheduling batches on related machines

DOI10.1016/j.orl.2006.01.005zbMath1145.90022OpenAlexW2076273541MaRDI QIDQ2643820

Tamás Kis, Richárd Kápolnai

Publication date: 27 August 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.01.005

zbMATH Keywords

auctionsmechanism designbatch-schedulingapproximation-algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Batch scheduling with deadlines on parallel machines
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Scheduling with batching: A review
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Bounds for LPT Schedules on Uniform Processors
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• STACS 2004
• Algorithms – ESA 2005
• STACS 2005

This page was built for publication: Approximations and auctions for scheduling batches on related machines