关键词: 机器调度, 可控加工时间, 多主体, 组合拍卖, 分布式调度

Abstract: To deal with parallel machine scheduling with controllable processing times,a multi-agent scheduling mechanism based on iterative combinatorial auction was designed.By combining the general form of combinatorial auction with the modeling technology of machine scheduling,the controllable processing times were introduced in a model of Winner Determination Problem(WDP)to achieve effective resource allocation.To accelerate the convergence of auction,an adaptive price updating mechanism based on sub-gradient method was designed.Simulation results showed that the proposed scheduling scheme outperformed the traditional mechanism with uncontrollable processing times by effectively enhancing the machine utilization level and the system revenue.

Key words: machine scheduling, controllable processing times, multi-agent, combinatorial auction, distributed scheduling