Abstract
Computing an optimal solution to an integer program for a realistic scheduling problem can often be very time consuming. As a result, ad-hoc and hand-crafted heuristics have become popular alternatives. These methods, however, suffer from the inability to guarantee good or optimal solutions. Our objective in this work is to leverage on prior theoretical results from the OR literature and agent technology from the AI literature to derive a computational framework that can be easily implemented for solving decentralized scheduling problems. In decentralization, there is an issue that information and control are inherently private to individual agents, even though a solution has to be jointly derived. In this paper, we are concerned about the following class of decentralized scheduling problems:
-
1
There is a central pool of limited resources that comprises multiple units of resources for each machine type;
-
1
There are multiple self-interested agents and each has to obtain resources from the central pool to solve its own scheduling problem (job shop, flow shop, etc).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kutanoglu, E., Wu, S.D.: On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Transactions 31, 813–826 (1999)
Dewan, P., Joshi, S.: Auction-based distributed scheduling in a dynamic job shop environment. Int. Journal of Production Research 40(5), 1173–1191 (2002)
Arrow, K.J., Hurwicz, L.: Competitive Stability under Gross Substitutability: The Euclidean Distance Approach. Int. Economic Review 1, 38–49 (1960)
Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 27(1), 1–18 (1981)
Baruah, S.K., et al.: Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15, 600–625 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lau, H.C., Lye, K.W., Nguyen, V.B. (2008). A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract). In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-68155-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68154-0
Online ISBN: 978-3-540-68155-7
eBook Packages: Computer ScienceComputer Science (R0)