Multi-Agent single machine scheduling based on combinatorial auction

To solve the distributed single machine scheduling problem,a multi-agent scheduling mechanism based on iterative price combinatorial auction was designed.In this mechanism,the constraint based language was employed to build an improved winner determination model by combining the general form of combinatorial auction with the modeling technology of machine scheduling.The global objectives of this model included system revenue and machine utilization.While failing in the current round,a bidder could increase the bidding price or relax the temporal constraints to remain in the next round of the auction.Experimental results showed that the proposed scheduling scheme outperformed the traditional combinatorial auction-based mechanism by effectively enhancing the machine utilization level without reducing the system revenue.