加工时间可控的多主体调度问题  

Multi-agent scheduling with controllable processing times

作　　者：王刚[1] 陈秋双[1] 全雄文[1] 

机构地区：[1]南开大学计算机与控制工程学院,天津300071

出　　处：《计算机集成制造系统》2013年第9期2187-2192,共6页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(71172071);高等学校博士学科点专项科研基金资助项目(20120031110036)~~

摘　　要：为了解决加工时间可控条件下的并行机调度问题,设计了一种基于重复叫价组合拍卖的多主体调度机制。该机制将组合拍卖的一般形式与机器调度的建模技术相结合,将可控加工时间引入竞胜标模型,使生产资源得到更加有效的配置;在价格更新方法上,设计了一种基于次梯度的自适应价格更新机制,提高了拍卖的收敛速度。对该机制进行了仿真实验。结果表明,与传统的"刚性"加工时间的调度模型相比,该机制在提高资源拥有者收益的同时,使生产资源得到了更加充分的利用。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.

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

分 类 号：TH166[机械工程—机械制造及自动化]