Affiliation:
1. Department of Computer Science and Information Systems, College of Business, University of North Alabama, Florence, AL, USA
Abstract
Business matchmaking is a service dedicated to providing one-on-one appointments for small businesses (or sellers) to meet with government agencies and large corporations (or buyers) for contracting opportunities. Business matchmaking scheduling seeks to maximize the total number of appointments with the maximum objective that weighs the preferences of both buyers and sellers. In this paper, the authors transformed the business matchmaking scheduling problem into a 3-dimensional planar assignment problem and solved it heuristically using a series of bipartite maximum weighted maximum cardinality matching problems. Simulation experiments and real data showed that this algorithm outperforms human experts and prior algorithm in terms of number of appointments, the objective that weighs buyer and seller’s preferences, and the execution time.
Subject
Information Systems and Management,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Information Systems,Management Information Systems
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity of a one-to-one meeting scheduling problem with two types of actors;Journal of the Operational Research Society;2015-10
2. Minimizing Makespan on Identical Parallel Machines;International Journal of Operations Research and Information Systems;2015-01