Summary
In this paper we study the problem of scheduling a set of jobs through a set of machines where the processing speed of the machines can differ. We assume that the waiting cost of each job is private information and that all jobs take identical processing time in any given machine. By allowing for monetary transfer, we identify the complete class of multiple non-identical machine scheduling problems for which we can find information revelation mechanisms that lead to (a) minimization of aggregate cost (or efficiency) and (b) costless information extraction.
The author is grateful to Hervé Moulin for suggesting this problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brucker P (1995) Scheduling Algorithms, Springer-Verlag, New York.
Clarke EH (1971) Public Choice 11:17–33
Dudek RA, Panwalkar S, Smith M (1975) Management Science 21:544–549
Dudek RA, Teuton Jr. OF (1964) Operations Research 12:471–497
Green J, Laffont JJ (1979) Incentives in Public Decision Making. North Holland Publication, Amsterdam.
Groves T (1973) Econometrica 41:617–631
Groves T, Ledyard JO (1977) Public Choice 29:107–124
Groves T, Loeb M (1975) Journal of Public Economics 4:211–226
Holmström B (1979) Econometrica 47:1137–1144
Hurwicz L, Walker M (1990) Econometrica 58:683–704
Krabbenborg M, Potters J, van den Nouweland A (1992) European Journal of Operational Research 62:38–46
Liu L, Tian G (1999) Review of Economic Design 4:205–218
Mitra M (2001) Economic Theory 17:277–305
Mitra M (2002) Review of Economic Design 7:75–91
Mitra M (2005) European Journal of Operational Research 165:251–266
Suijs J (1996) Economic Design 2:193–209
Tian G (1996) Economics Letters 53:17–24
Vickrey W (1961) Journal of Finance 16:8–37
Walker M (1980) Econometrica 48:1521–1540.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Italia
About this paper
Cite this paper
Mitra, M. (2006). Information Extraction in Scheduling Problems with Non-Identical Machines. In: Chatterjee, A., Chakrabarti, B.K. (eds) Econophysics of Stock and other Markets. New Economic Windows. Springer, Milano. https://doi.org/10.1007/978-88-470-0502-0_18
Download citation
DOI: https://doi.org/10.1007/978-88-470-0502-0_18
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-0501-3
Online ISBN: 978-88-470-0502-0
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)