Incomplete information and multiple machine queueing problems

DOI10.1016/J.EJOR.2003.10.050zbMath1112.90320OpenAlexW2146491663MaRDI QIDQ1776969

Manipushpak Mitra

Publication date: 12 May 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10419/78417

zbMATH Keywords

queueing problemsfirst best implementability

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

Recent developments in the queueing problem ⋮ Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency ⋮ Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs ⋮ Group strategyproofness in queueing models ⋮ Simple sequencing problems with interdependent costs ⋮ Efficient allocation of heterogeneous commodities with balanced transfers ⋮ No-envy in the Queueing Problem with Multiple Identical Machines ⋮ Comments on: ``Recent developments in the queueing problem

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of optimal truth-dominant mechanisms
• Sequencing games
• Flow-shops with a dominant machine
• On the balancedness of multiple machine sequencing games
• On the Generic Nonoptimality of Dominant-Strategy Allocation Mechanisms: A General Theorem That Includes Pure Exchange Economies
• On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Incentives in Teams
• Groves' Scheme on Restricted Domains
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
• Mechanism design in queueing problems

This page was built for publication: Incomplete information and multiple machine queueing problems