Cycle monotonicity in scheduling models

MaRDI QIDQ3400586zbMATH OpenFDO

Authors Debasis Mishra, Manipushpak Mitra

Publication date 5 February 2010

zbMATH Keywords

agentsdirected graphsrevenue equivalencestrategy proofnesstransfer rule

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs
• A unified approach to truthful scheduling on related machines
• Optimal Mechanisms for Single Machine Scheduling
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity
• Approximation and Online Algorithms

Cited in

(8)

• Recovering cyclic schedules from delay
• Balanced implementability of sequencing rules
• Dynamising Interval Scheduling: The Monotonic Case
• Information extraction in scheduling problems with non-identical machines
• On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
• Non-monotonically rewarded job scheduling
• On slots' scheduling
• The Shapley value in positional queueing problems

This page was built for publication: Cycle monotonicity in scheduling models

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