Cost sharing in a job scheduling problem

DOI10.1007/S00355-006-0210-3zbMATH Open1180.90132OpenAlexW3123365255MaRDI QIDQ2385122FDOQ2385122

Bharath Rangarajan, Debasis Mishra

Publication date: 11 October 2007

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00355-006-0210-3

Recommendations

• Cost-sharing mechanisms for scheduling under general demand settings
• Cost Sharing Methods for Makespan and Completion Time Scheduling
• Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
• Fair cost-sharing methods for scheduling jobs on parallel machines
• Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling
• The job shop scheduling problem with convex costs
• Budget-constrained cost-covering job assignment for a total contribution-maximizing platform
• Sharing delay costs in stochastic scheduling problems with delays
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
• Sharing costs in some distinguished location problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Cooperative games (91A12)

Cites Work

• Sequencing games
• A characterization of the Shapley value in queueing problems
• Achieving the first best in sequencing problems.
• On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
• The split core for sequencing games
• An Application of the Shapley Value to Fair Division with Money

Cited In (8)

• Auctioning and selling positions: a non-cooperative approach to queueing conflicts
• Balanced consistency and balanced cost reduction for sequencing problems
• Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
• Shapley value for parallel machine sequencing situation without initial order
• Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
• Approximating the least core value and least core of cooperative games with supermodular costs
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
• Capacity allocation games without an initial sequence

This page was built for publication: Cost sharing in a job scheduling problem

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