On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs

DOI10.1287/moor.1060.0239zbMath1279.90070MaRDI QIDQ5388029

Hervé Moulin

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.1418

zbMATH Keywords

scheduling; splitting; queuing; merging; linear waiting cost; transferring

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B22: Queues and service in operations research

Related Items

Balanced VCG mechanisms for sequencing problems, Some characterizations of generalized top trading cycles, Revenue management for cloud computing providers: decision models for service admission control under non-probabilistic uncertainty, Auctioning and selling positions: a non-cooperative approach to queueing conflicts, Characterizing the Shapley value in fixed-route traveling salesman problems with appointments, Balanced consistency and balanced cost reduction for sequencing problems, Consistency and monotonicity in sequencing problems, Children crying at birthday parties. Why?, Proportional scheduling, split-proofness, and merge-proofness, Coordination mechanisms for selfish scheduling, Path auctions with multiple edge ownership, Second-best mechanisms in queuing problems without transfers: the role of random priorities, Pairwise mergers in bipartite matching games with an application in collaborative logistics, Pricing traffic in a spanning network, On optimal mechanism design for a sequencing problem, Randomized selection algorithm for online stochastic unrelated machines scheduling, Decentralized task coordination, No-envy, solidarity, and strategy-proofness in the queueing problem, Reassignment-proof rules for land rental problems, New variable-population paradoxes for resource allocation, Stability and fairness in the job scheduling problem, Balanced implementability of sequencing rules, Cost sharing in a job scheduling problem, Incentives and justice for sequencing problems, Recent developments in the queueing problem, Rejoinder on: ``Recent developments in the queueing problem, Compensation and sacrifice in the probabilistic rationing of indivisible units