Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines

DOI10.1007/11758471_19MaRDI QIDQ3434555zbMATH OpenOpenAlexFDO

Authors Yvonne Bleischwitz, Burkhard Monien

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_19

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Fair cost-sharing methods for scheduling jobs on parallel machines
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
• New efficiency results for makespan cost sharing
• Cost-sharing mechanisms for scheduling under general demand settings
• Cost Sharing Methods for Makespan and Completion Time Scheduling

Cited in

(8)

• New efficiency results for makespan cost sharing
• Stability and fairness in the job scheduling problem
• Cost-sharing mechanisms for scheduling under general demand settings
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
• Fair cost-sharing methods for scheduling jobs on parallel machines
• Cost sharing in a job scheduling problem
• Cost Sharing Methods for Makespan and Completion Time Scheduling

This page was built for publication: Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines

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