• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Computer and Information Sciences(ISCIS 2004); 20041027-29; Kemer-Antalya(TR) >Comparison of Different Variable and Value Order Strategies for the Optimum Solution of a Single Machine Scheduling Problem with Sequence-Dependent Setups
【24h】

Comparison of Different Variable and Value Order Strategies for the Optimum Solution of a Single Machine Scheduling Problem with Sequence-Dependent Setups

机译：具有序列相关设置的单机调度问题最优解的不同变量和值顺序策略的比较

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The job sequencing problem for a single machine with sequence-dependent setups is solved using the constraint programming (CP) and mixed-integer programming (MIP) approaches. For the CP search, ten different variable and value ordering heuristics are tested using both the CP model and/or the combined model of the MIP and CP formulations. Some of these heuristics exploit problem specific data like setup cost and due date. Others rely on hybrid strategies that use the linear programming (LP) solver within the CP search or direct the search using the initial feasible solution obtained from the MIP model. A comparative analysis of the search heuristics and the CP and MIP solvers has been given with respect to the solution times. The research results indicate that the CP solver finds the optimum solution in a very short time compared to the MIP solver as the number of jobs to be scheduled increases.
机译：使用约束编程（CP）和混合整数编程（MIP）方法解决了具有序列相关设置的单台机器的作业排序问题。对于CP搜索，使用CP模型和/或MIP和CP公式的组合模型测试了十种不同的变量和值排序试探法。其中一些启发式方法会利用问题特定的数据，例如设置成本和到期日。其他人则依赖于在CP搜索中使用线性规划（LP）求解器的混合策略，或者使用从MIP模型获得的初始可行解来指导搜索。针对求解时间，对搜索启发式算法和CP和MIP求解器进行了比较分析。研究结果表明，与要调度的作业数量相比，与MIP求解器相比，CP求解器可以在很短的时间内找到最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号