Auction based scheduling for distributed systems

Date
2006
Advisor
Instructor
Source Title
Proceedings of the 10th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2006, 12th International Conference on Information Systems Analysis and Synthesis, ISAS 2006
Print ISSN
Electronic ISSN
Publisher
International Institute of Informatics and Systemics
Volume
1
Issue
Pages
244 - 249
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Abstract

Businesses deal with huge databases over a geographically distributed supply network. When this is combined with scheduling and planning needs, it becomes too difficult to handle. Recently, Fast Consumer Goods sector tends to consolidate their manufacturing facilities on a single supplier serving to a distributed customer network. This decentralized structure causes imperfect information sharing between customers and the supplier. We model this problem as a single machine distributed scheduling problem with job agents representing the customers and the machine agent representing the supplier. We developed Auction Based Algorithm by exploiting the opportunity to use game theoretic approach to solve the problem in the decentralized utility case. Results of our extensive computational experiments indicate that Auction Based Algorithm converges to the upper bound found for the total utility measure.

Course
Other identifiers
Book Title
Keywords
Auction based scheduling, Decentralized scheduling, Distributed scheduling, Single machine scheduling, Supply chain scheduling, Computational experiment, Customer networks, Distributed scheduling problem, Distributed systems, Imperfect information, Manufacturing facility, Supply networks, Information science, Information systems, Management information systems, Supply chains, Systems analysis
Citation
Published Version (Please cite this version)