Priority rules for job shops with weighted tardiness costs
Management Science
Botticelli: A Supply Chain Management Agent
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Agent-Based Supply Chain Management: Bidding for Customer Orders
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Designing a successful trading agent for supply chain management
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The supply chain trading agent competition
Electronic Commerce Research and Applications
Adaptive strategies for predicting bidding prices in supply chain management
Proceedings of the 10th international conference on Electronic commerce
Proceedings of the 11th International Conference on Electronic Commerce
| Hi-index | 0.00 |
Existing supply chain management practices consist primarily of static interactions between established partners. Global competition, shorter product life cycles and the emergence of Internet-mediated business solutions create an incentive for exploring more dynamic supply chain practices. The Supply Chain Trading Agent Competition (TAC SCM) was designed to explore approaches to dynamic supply chain trading. TAC SCM pits against one another trading agents developed by teams from around the world. This paper presents Carnegie Mellon University's 2005 TAC SCM entry, the CMieux supply chain trading agent. CMieux implements a novel approach to coordinating supply chain bidding, procurement and planning, with an emphasis on the ability to rapidly adapt to changing market conditions. We present empirical results based on 200 games involving agents entered by 25 different teams during what can be seen as the most competitive phase of the 2005 tournament. Not only did CMieux perform among the top five agents, it significantly outperformed these agents in procurement while matching their bidding performance.