Multi-agent single machine scheduling with controllable processing times

To deal with single machine scheduling with controllable processing times, an iterative combinatorial-auction-based multi-agent scheduling mechanism is designed. The controllable processing times are incorporated in the Winner Determination Problem (WDP) so as to enhance the utility of the resource. An adapted price updating mechanism based on sub-gradient method is employed to accelerate the convergence of the auction. Experimental results show that the proposed scheduling scheme outperforms the traditional mechanism with uncontrollable processing times by enhancing the system revenue, the utility of the resource, and the quality of service.