Auction based scheduling for distributed systems
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
International Institute of Informatics and Systemics
244 - 249
Item Usage Stats
MetadataShow full item record
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.
KeywordsAuction based scheduling
Single machine scheduling
Supply chain scheduling
Distributed scheduling problem
Management information systems
Showing items related by title, author, creator and subject.
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability Gören, S.; Sabuncuoğlu, İhsan (Institute of Industrial Engineers, 2007)The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ...
Ulusoy, Ö. (Springer/Kluwer Academic Publishers, 1994)A database system supporting a real-time application has to provide real-time information to the executing transactions. Each real-time transaction is associated with a timing constraint, typically in the form of a deadline. ...
Öztürk, Özcan; Kandemir, M.; Narayanan, S. H. K. (IEEE, 2008-03)Executing array based applications on a chip multiprocessor requires effective loop parallelization techniques. One of the critical issues that need to be tackled by an optimizing compiler in this context is loop scheduling, ...