A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)

Autor:	Kong Wei Lye, Hoong Chuin Lau, Viet Bang Nguyen
Rok vydání:	2008
Předmět:	Combinatorial auction Mathematical optimization Job shop scheduling Computer science Leverage (statistics) Flow shop scheduling Auction algorithm Heuristics Decentralization Scheduling (computing)
Zdroj:	Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783540681540 CPAIOR
DOI:	10.1007/978-3-540-68155-7_33
Popis:	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
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5f0694b8273ba4b733e537d9de941590 https://doi.org/10.1007/978-3-540-68155-7_33 Zobrazit plný text záznamu