摘要
目前机器调度模型对机器可用性的假定是,或者机器一直可用,或者在某些固定时候不可用。而实际应用中,工厂可通过机器的开关优化来节能减排。研究这样一种情况,机器的开关时间点和长度都不确定,需要在决策过程中决定,目标是最小化加权完成时间和节省成本。采用了基于列生成的分支定界法来求解,并结合了动态规划法来提高方法的效率。结果证明,该方法对求解中小规模的问题有很好的效率。
The usual assumptions in current literature on machine scheduling are the machines are always either available or unavailable for some periods.However,in practice,energy saving and pollution reduction can be achieved by optimizing machines＇ power on/off.This paper studies a parallel machine scheduling with consideration that neither the length nor the start time of unavailability is fixed.This paper presents a branch and bound algorithm to solve the problem.The computation results show that,within a reasonable computation time,problems with a medium size can be solved to optimality by the algorithm.
出处
《工业工程与管理》
北大核心
2011年第2期60-64,71,共6页
Industrial Engineering and Management
关键词
机器开关
并行机调度
分支定界法
machine power on/off
parallel machine scheduling
branch and bound
