Scholarlink

This paper presents an improved discrete optimisation procedure in application to a classical scheduling problem. This procedure has shown promising results in the past; however, advancements in techniques and software have prompted a comparison with modern developments. The improvements to the discrete optimisation procedure proposed in this paper, strengthened the procedure’s search efficiency as demonstrated by comprehensive computational experiments with comparison to a commercial constraint programming solver.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An Improved Discrete Optimisation Procedure with Comparison to Constraint Programming

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Hayden Merrick,
  • Julia Memar,
  • Hanyu Gu

摘要

This paper presents an improved discrete optimisation procedure in application to a classical scheduling problem. This procedure has shown promising results in the past; however, advancements in techniques and software have prompted a comparison with modern developments. The improvements to the discrete optimisation procedure proposed in this paper, strengthened the procedure’s search efficiency as demonstrated by comprehensive computational experiments with comparison to a commercial constraint programming solver.