2,363
Views
10
CrossRef citations to date
0
Altmetric
Research Article

An iterative combinatorial auction mechanism for multi-agent parallel machine scheduling

, , ORCID Icon & ORCID Icon
Pages 361-380 | Received 10 Apr 2021, Accepted 25 Jun 2021, Published online: 19 Jul 2021

References

  • Abrache, J., T. G. Crainic, M. Gendreau, and T. Aouam. 2013. “A Study of Auction Mechanisms for Multilateral Procurement Based on Subgradient and Bundle Methods.” INFOR: Information Systems and Operational Research 51 (1): 2–14.
  • Abrache, J., T. G. Crainic, M. Gendreau, and T. Aouam. 2014. “An Auction Mechanism for Multilateral Procurement Based on Dantzig-Wolfe Decomposition.” In 2nd International IEEE Conference on Logistics Operations Management (GOL 2014). Rabat, Morocco.
  • Abrache, J., T. G. Crainic, M. Gendreau, and M. Rekik. 2007. “Combinatorial Auctions.” Annals of Operations Research 153 (1): 131–164.
  • Agnetis, A., J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli, and A. Soukhal. 2014. “Parallel Machine Scheduling Problems.” In Multiagent Scheduling, 189–215. Berlin, Heidelberg: Springer.
  • Agnetis, A., P. B. Mirchandani, D. Pacciarelli, and A. Pacifici. 2004. “Scheduling Problems with Two Competing Agents.” Operations Research 52 (2): 229–242.
  • Ahn, H., J. Kim, and J. Kim. 2021. “Auction-Based Truthful Distributed Resource Allocation for Smart Grid Systems.” In 2021 International Conference on Information Networking (ICOIN), 53–55. IEEE.
  • Amir, O., G. Sharon, and R. Stern. 2015. “Multi-Agent Pathfinding as a Combinatorial Auction.” In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 29. Austin, Texas.
  • Attanasio, A., G. Ghiani, L. Grandinetti, and F. Guerriero. 2006. “Auction Algorithms for Decentralized Parallel Machine Scheduling.” Parallel Computing 32 (9): 701–709.
  • Bansal, A., R. Uzsoy, and K. Kempf. 2020. “Iterative Combinatorial Auctions for Managing Product Transitions in Semiconductor Manufacturing.” IISE Transactions 52 (4): 413–431.
  • Biskup, D., J. Herrmann, and J. N. Gupta. 2008. “Scheduling Identical Parallel Machines to Minimize Total Tardiness.” International Journal of Production Economics 115 (1): 134–142.
  • Boughaci, D. 2013. “Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction.” In Artificial Intelligence, Evolutionary Computing and Metaheuristics, 775–791. Berlin, Heidelberg: Springer.
  • Chaudhry, I. A., and I. A. Elbadawi. 2017. “Minimisation of Total Tardiness for Identical Parallel Machine Scheduling Using Genetic Algorithm.” Sādhanā 42 (1): 11–21.
  • Cheng, T. E., C.-Y. Liu, W.-C. Lee, and M. Ji. 2014. “Two-Agent Single-Machine Scheduling to Minimize the Weighted Sum of the Agents' Objective Functions.” Computers & Industrial Engineering 78: 66–73.
  • Cheng, C.-B., and C.-Y. Lo. 2017. “Multi-Project Scheduling by Fuzzy Combinatorial Auction.” In 2017 3rd IEEE International Conference on Cybernetics (CYBCONF), 1–6. IEEE.
  • Dewan, P., and S. Joshi. 2000. “Dynamic Single-Machine Scheduling Under Distributed Decision-Making.” International Journal of Production Research 38 (16): 3759–3777.
  • Dewan, P., and S. Joshi. 2002. “Auction-Based Distributed Scheduling in a Dynamic Job Shop Environment.” International Journal of Production Research 40 (5): 1173–1191.
  • Fang, K.-T., and B. M. Lin. 2013. “Parallel-Machine Scheduling to Minimize Tardiness Penalty and Power Cost.” Computers & Industrial Engineering 64 (1): 224–234.
  • Fink, A., and J. Homberger. 2013. “An Ant-Based Coordination Mechanism for Resource-Constrained Project Scheduling with Multiple Agents and Cash Flow Objectives.” Flexible Services and Manufacturing Journal 25 (1): 94–121.
  • Fu, Y., H. Wang, G. Tian, Z. Li, and H. Hu. 2019. “Two-Agent Stochastic Flow Shop Deteriorating Scheduling Via a Hybrid Multi-Objective Evolutionary Algorithm.” Journal of Intelligent Manufacturing 30 (5): 2257–2272.
  • Hall, N. G., and Z. Liu. 2013. “Market Good Flexibility in Capacity Auctions.” Production and Operations Management 22 (2): 459–472.
  • Homberger, J. 2012. “A (μ, λ)-Coordination Mechanism for Agent-Based Multi-Project Scheduling.” OR Spectrum 34 (1): 107–132.
  • Homberger, J., and A. Fink. 2017. “Generic Negotiation Mechanisms with Side Payments–Design, Analysis and Application for Decentralized Resource-Constrained Multi-Project Scheduling Problems.” European Journal of Operational Research 261 (3): 1001–1012.
  • Hou, L., C. Wang, and J. Yan. 2019. “Bidding for Preferred Timing: An Auction Design for Electric Vehicle Charging Station Scheduling.” IEEE Transactions on Intelligent Transportation Systems 21 (8): 3332–3343.
  • Karabatı, S., and Z. B. Yalçın. 2014. “An Auction Mechanism for Pricing and Capacity Allocation with Multiple Products.” Production and Operations Management 23 (1): 81–94.
  • Klein, M., P. Faratin, H. Sayama, and Y. Bar-Yam. 2003. “Negotiating Complex Contracts.” Group Decision and Negotiation 12 (2): 111–125.
  • Krajewska, M. A., and H. Kopfer. 2006. “Collaborating Freight Forwarding Enterprises.” OR Spectrum 28 (3): 301–317.
  • Kutanoglu, E., and S. David Wu. 1999. “On Combinatorial Auction and Lagrangean Relaxation for Distributed Resource Scheduling.” IIE Transactions 31 (9): 813–826.
  • Kutanoglu, E., and S. D. Wu. 1999. “An Auction-Theoretic Modeling of Production Scheduling to Achieve Distributed Decision Making.” PhD thesis, Citeseer.
  • Lang, F., and A. Fink. 2015. “Learning From the Metaheuristics: Protocols for Automated Negotiations.” Group Decision and Negotiation 24 (2): 299–332.
  • Lang, F., A. Fink, and T. Brandt. 2016. “Design of Automated Negotiation Mechanisms for Decentralized Heterogeneous Machine Scheduling.” European Journal of Operational Research 248 (1): 192–203.
  • Lee, K., B.-C. Choi, J. Y.-T. Leung, and M. L. Pinedo. 2009. “Approximation Algorithms for Multi-Agent Scheduling to Minimize Total Weighted Completion Time.” Information Processing Letters 109 (16): 913–917.
  • Leung, S. C., D. Zhang, C. Zhou, and T. Wu. 2012. “A Hybrid Simulated Annealing Metaheuristic Algorithm for the Two-Dimensional Knapsack Packing Problem.” Computers & Operations Research39 (1): 64–73.
  • Liu, L., C. Wang, and J. Wang. 2019. “A Combinatorial Auction Mechanism for Surgical Scheduling Considering Surgeon's Private Availability Information.” Journal of Combinatorial Optimization 37 (1): 405–417.
  • Liu, Y., L. Wang, Y. Wang, X. V. Wang, and L. Zhang. 2018. “Multi-Agent-Based Scheduling in Cloud Manufacturing with Dynamic Task Arrivals.” Procedia CIRP 72: 953–960.
  • Nguyen, N.-T., T. T. Nguyen, M. Roos, and J. Rothe. 2014. “Computational Complexity and Approximability of Social Welfare Optimization in Multiagent Resource Allocation.” Autonomous Agents and Multi-Agent Systems 28 (2): 256–289.
  • Parkes, D. C. 2006. Iterative Combinatorial Auctions. Cambridge, MA: MIT press.
  • Perez-Gonzalez, P., and J. M. Framinan. 2014. “A Common Framework and Taxonomy for Multicriteria Scheduling Problems with Interfering and Competing Jobs: Multi-Agent Scheduling Problems.” European Journal of Operational Research 235 (1): 1–16.
  • Rosen, C., and R. Madlener. 2013. “An Auction Design for Local Reserve Energy Markets.” Decision Support Systems 56: 168–179.
  • Roughgarden, T., and E. Tardos. 2007. “Introduction to the Inefficiency of Equilibria.” Algorithmic Game Theory 17: 443–459.
  • Sadi, F., A. Soukhal, and J.-C. Billaut. 2014. “Solving Multi-Agent Scheduling Problems on Parallel Machines with a Global Objective Function.” RAIRO-Operations Research 48 (2): 255–269.
  • Sandholm, T., S. Suri, A. Gilpin, and D. Levine. 2002. “Winner Determination in Combinatorial Auction Generalizations.” In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 1, 69–76. Bologna, Italy.
  • Sasaki, D., and T. Nishi. 2015. “Combinatorial Auction Algorithm with Price-Adjustment Mechanism for Airline Crew Scheduling Problems.” In 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 1183–1187. IEEE.
  • Schneeweiss, C. 2003. “Distributed Decision Making – A Unified Approach.” European Journal of Operational Research 150 (2): 237–252.
  • Sen, A. K., A. Bagchi, and S. Chakraborty. 2020. “Designing Information Feedback for Bidders in Multi-Item Multi-Unit Combinatorial Auctions.” Decision Support Systems 130: 113–230.
  • Song, W., D. Kang, J. Zhang, and H. Xi. 2016. “Decentralized Multi-Project Scheduling Via Multi-Unit Combinatorial Auction.” In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 836–844. Singapore.
  • Song, W., D. Kang, J. Zhang, and H. Xi. 2017. “A Multi-Unit Combinatorial Auction Based Approach for Decentralized Multi-Project Scheduling.” Autonomous Agents and Multi-Agent Systems 31 (6): 1548–1577.
  • Tafsiri, S. A., and S. Yousefi. 2018. “Combinatorial Double Auction-Based Resource Allocation Mechanism in Cloud Computing Market.” Journal of Systems and Software 137: 322–334.
  • Tang, J., C. Zeng, and Z. Pan. 2016. “Auction-Based Cooperation Mechanism to Parts Scheduling for Flexible Job Shop with Inter-Cells.” Applied Soft Computing 49: 590–602.
  • Wang, C., Z. Wang, H. H. Ghenniwa, and W. Shen. 2011. “Due-Date Management Through Iterative Bidding.” IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans 41 (6): 1182–1198.
  • Wellman, M. P., W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason. 2001. “Auction Protocols for Decentralized Scheduling.” Games and Economic Behavior 35 (1–2): 271–303.
  • Yazdani, M., S. M. Khalili, and F. Jolai. 2016. “A Parallel Machine Scheduling Problem with Two-Agent and Tool Change Activities: An Efficient Hybrid Metaheuristic Algorithm.” International Journal of Computer Integrated Manufacturing 29 (10): 1075–1088.
  • Zeng, C., J. Tang, and Z.-P. Fan. 2019. “Auction-Based Cooperation Mechanism for Cell Part Scheduling with Transportation Capacity Constraint.” International Journal of Production Research 57 (12): 3831–3846.
  • Zeng, C., J. Tang, Z.-P. Fan, and C. Yan. 2019. “Auction-Based Approach for a Flexible Job-Shop Scheduling Problem with Multiple Process Plans.” Engineering Optimization 51 (11): 1902–1919.