期刊文献+

求解Job-Shop约束满足问题的变量排序算法比较研究

Variable Ordering for Job-shop Constraint Satisfaction Problems
下载PDF
导出
摘要 针对约束满足求解技术中的变量排序,提出了量化Job-Shop调度问题特征的5项指标和相关参数。分别从约束连通度、变量约束偏差、约束紧度、规模及资源利用率偏差等角度设计异构算例对现有典型变量排序算法进行比较分析,实验结果明确了算法效果与问题特征之间的相对适应度,可为构造更有效的搜索策略提供参考。 In order to employ variable ordering of constraint satisfaction technology, this paper presents five indexes as well as related parameters to describe the features of Job-shop scheduling problems. Several cases are designed to test typical kinds of variable ordering taking into account of problem sizes, constraint tightness, connectivity of constraint graphs, deviation of variable constraint quantity and resource utilization, which demonstrates the correlation of variable ordering to the features of problems.
作者 尹静 李铁克
出处 《工业工程》 2008年第4期113-117,共5页 Industrial Engineering Journal
基金 国家自然科学基金资助项目(70771008)
关键词 JOB-SHOP问题 约束满足 变量排序 问题结构 Jop-shop constraint satisfaction variable ordering problem structure
  • 相关文献

参考文献10

  • 1Brilsford S C, Potts C N, Smith B M. Constraint satisfaction problem: algorithms and applications [ J ]. European Journal of Operational Research, 1999, 119 (3) : 557-581.
  • 2杨宏安,孙树栋,王荪馨,柴永生.基于CSP的Job shop调度算法研究[J].系统工程,2004,22(11):15-18. 被引量:9
  • 3郭冬芬,李铁克.基于约束满足的车间调度算法综述[J].计算机集成制造系统,2007,13(1):117-125. 被引量:34
  • 4Khalil S Hindi, Krzysztof Fleszar. A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem [J]. Computers & Industrial Engineering, 2004, 47(1) : 91-101.
  • 5Edward Tsang. Foundations of constraint satisfaction [ M ]. London : Academic Press, 1993 : 157-184.
  • 6Baptiste P, Pape C L, Nuijten W. Constraint-based scheduling [ M ]. Boston: Kluwer Academic Publishers, 2001 : 157-184.
  • 7Laborie P, Nuijten W. AIPS' 02 Tutorial: Constraint-based scheduling in an AI Planning and scheduling Perspective [ C ]//The 6th International Conference on AI Planning & Scheduling, France : Kanf Press, 2002 : 51-76.
  • 8Sadeh N, Fox M S. Variable and value ordering heuristics for the Job-Shop scheduling constraints satisfaction problem [ J ]. Artificial Intelligence, 1996, 86 ( 1 ) : 1-41.
  • 9J Christopher Beck, Mark S Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics [J]. Artificial Intelligence, 2000,117 (1): 31-81.
  • 10Jain A S, Meeran S. Deterministic Job-Shop scheduling: Past, Present and Future [ J]. European Journal of Operational Research, 1999,113 (2) : 390-434.

二级参考文献40

  • 1杨宏安,孙树栋,王荪馨,柴永生.基于CSP的Job shop调度算法研究[J].系统工程,2004,22(11):15-18. 被引量:9
  • 2郭冬芬,李铁克.基于约束满足方法求解炼钢—连铸生产调度问题[J].信息与控制,2005,34(6):753-758. 被引量:9
  • 3Tsang E. Foundations of constraint satisfaction[M]. London:Academic Press,1995.
  • 4Baptiste P,Pape L. Constraint-based optimization and approximation for job shop scheduling[A]. Proceedings of the AAAI-SIGMAN workshop on intelligent manufacturing systems,IJCAI-95[C]. Canada,1995.
  • 5Minton S. Integrating heuristics for constraint satisfaction problems:a case study[A]. Proceedings of AAAI-93[C]. 1993.
  • 6Dechter R. Network-based heuristics for constraint satisfaction problem[J]. Artificial Intelligence,1987,34.
  • 7Fox M S. Constraint-directed search:a case study of job-shop scheduling[D]. Department of Computer Science,Carnegie-Mellon University, 1983.
  • 8FOX M S,SMITH S F.ISIS-a knowledge-based system for factory scheduling[J].Expert Systems,1984,1(1):2549.
  • 9BRALSFORD S C,POTTS C N,SMITH B M.Invited review:constraint satisfaction problems:algorithms and applications[J].European Journal of Operational Research,1999,119(3):57-581.
  • 10CESTA A,ODDI A,SMITH S F.A constrained-based method for project scheduling with time windows[J].Journal of Heuristics,2002,8(1):109-136.

共引文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部