摘要
针对k-阶段等速机无等待混合流水车间最小化最大完工期的调度问题,提出基于约束规划的模型和求解策略。模型利用约束规划自然地表达问题的优化目标和约束条件。求解策略包括采用有限深度偏离搜索例程、采用限定失败次数策略、综合运用离散资源、一元资源和替代资源约束表达工件在各阶段对设备要求等。通过数值实验验证了约束规划方法的有效性。整个方法能够很好地满足实际应用中对计算效率和效果的要求。
A constraint programming approach to the problem of k-stage hybrid flowshop scheduling on identical parallel machines with no-wait constraint to minimize makespan is presented. The objective and constraints of the problem are expressed naturally by the proposed model. The solving strategy, including employment of the depth-bounded discrepancy search procedure, the limited number of failures search strategy and the integration of discrete, unary and alternative resource to express machine requirements of jobs at each stage, is introduced. The constraint programming approach is validated by computation. The proposed method are capable of meeting the practical requirements both in efficiency and effect.
出处
《化工自动化及仪表》
CAS
2007年第3期26-29,共4页
Control and Instruments in Chemical Industry
基金
国家自然科学基金资助项目(70371057)
关键词
无等待
混合流水车间
调度
约束规划
求解策略
有限深度偏离搜索
no-wait
hybrid flowshop
scheduhng
constraint programming
solving strategy
depth-bounded discrepancy search
