A rescheduling and cost allocation mechanism for delayed arrivals
We reschedule arrivals at a processing center that are subject to a delay. Rescheduling is done according to a VickreyClarkeGroves mechanism. The mechanism is strategyproof so no arrival has incentive to misreport. The mechanism runs a standard assignment problem and is computationally efficient. We present computational results and show that the cost savings are very significant.
vickreyclarkegroves mechanism assignment problem production scheduling combinatorial exchange