Cross Company Resource and Time Assignment in a Combinatorial Auction Scenario

摘要

In the following paper we analyze a complex resource and time assignment problem. We introduce algorithms and strategies to find near optimal operative short term cooperations in collaboration frameworks consisting of SMEs (Small and Medium-sized Enterprises) according to different optimization targets. The algorithms use information obtained in an online auction scenario as well as from different types of history data. The expected number of solutions for the given problem, depending on the input parameters, is analyzed. Further, we discuss the Important Paths Problem for directed graphs and show that it is of the same complexity as determining the transitive closure.