Approximations and auctions for scheduling batches on related machines

DOI10.1016/J.ORL.2006.01.005MaRDI QIDQ2643820zbMATH OpenOpenAlexFDO

Authors 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

approximation-algorithmsauctionsbatch-schedulingmechanism design

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• scientific article; zbMATH DE number 1405790
• Approximation schemes for scheduling a batching machine with nonidentical job size
• Efficient (re-)scheduling: an auction approach
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint
• Bounded parallel-batch scheduling on unrelated parallel machines

Cites work

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Algorithms – ESA 2005
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Batch scheduling with deadlines on parallel machines
• Bounds for LPT Schedules on Uniform Processors
• scientific article; zbMATH DE number 2079341 (Why is no real title available?)
• Scheduling with batching: A review
• STACS 2004
• STACS 2005

Cited in

(2)

• Efficient (re-)scheduling: an auction approach
• A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643820)