On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
From MaRDI portal
Publication:5388029
DOI10.1287/moor.1060.0239zbMath1279.90070OpenAlexW2162278657MaRDI QIDQ5388029
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
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Related Items
Revenue management for cloud computing providers: decision models for service admission control under non-probabilistic uncertainty, Cost sharing in a job scheduling problem, Incentives and justice for sequencing problems, Decentralized task coordination, Children crying at birthday parties. Why?, No-envy, solidarity, and strategy-proofness in the queueing problem, Reassignment-proof rules for land rental problems, Second-best mechanisms in queuing problems without transfers: the role of random priorities, Compensation and sacrifice in the probabilistic rationing of indivisible units, Recent developments in the queueing problem, Rejoinder on: ``Recent developments in the queueing problem, Auctioning and selling positions: a non-cooperative approach to queueing conflicts, Balanced VCG mechanisms for sequencing problems, Characterizing the Shapley value in fixed-route traveling salesman problems with appointments, Some characterizations of generalized top trading cycles, Balanced consistency and balanced cost reduction for sequencing problems, Pairwise mergers in bipartite matching games with an application in collaborative logistics, Proportional scheduling, split-proofness, and merge-proofness, New variable-population paradoxes for resource allocation, Consistency and monotonicity in sequencing problems, Pricing traffic in a spanning network, On optimal mechanism design for a sequencing problem, Stability and fairness in the job scheduling problem, Balanced implementability of sequencing rules, Coordination mechanisms for selfish scheduling, Path auctions with multiple edge ownership, Randomized selection algorithm for online stochastic unrelated machines scheduling
