首页> 外文期刊>International Journal of Production Research >Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu-SA approach
【24h】

Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu-SA approach

机译:为外包供应链中的计划和调度建模:基于混沌的快速禁忌SA方法

获取原文
获取原文并翻译 | 示例
       

摘要

Planning and Scheduling are the interrelated manufacturing functions and should be solved simultaneously to achieve the real motives of integration in manufacturing. In this paper, we have addressed the advanced integrated planning and scheduling problem in a rapidly changing environment, where the selection of outsourcing machine/operation, meeting the customers (single or multiple) due date, minimizing the makespan are the main objectives while satisfying several technological constraints. We developed a mixed integer programming model for integrated planning and scheduling across the outsourcing supply chain and showed how such models can be used to make strategic decisions. It is a computationally complex and mathematically intractable problem to solve. In this paper, a Chaos-based fast Tabu-simulated annealing (CFTSA) incorporating the features of SA, Tabu and Chaos theory is proposed and applied to solve a large number of problems with increased complexity. In CFTSA algorithm, five types of perturbation schemes are developed and Cauchy probability function is used to escape from local minima and achieve the optimalear optimal solution in a lesser number of iterations. An intensive comparative study shows the robustness of proposed algorithm. Percentage Heuristic gap is used to show the effectiveness and two ANOVA analyses are carried out to show the consistency and accuracy of the proposed approach.
机译:计划和计划是相互关联的制造功能,应该同时解决以实现制造中集成的真正动机。在本文中,我们解决了在瞬息万变的环境中出现的高级集成计划和计划问题,在该环境中,选择外包机器/操作,满足客户(单个或多个)到期日,最小化制造期是主要目标,同时又要满足几个技术限制。我们开发了一个混合整数规划模型,用于整个外包供应链中的集成计划和调度,并展示了如何使用此类模型来制定战略决策。这是一个计算复杂且在数学上难以解决的问题。本文提出了一种融合了SA,禁忌和混沌理论特征的基于混沌的快速禁忌模拟退火算法(CFTSA),并将其应用于解决大量复杂性增加的问题。在CFTSA算法中,开发了五种类型的摄动方案,并使用柯西概率函数来逃避局部极小值,并以较少的迭代次数获得最优/接近最优解。深入的对比研究表明了该算法的鲁棒性。百分比启发式差距用于显示有效性,并进行了两次方差分析以显示所提出方法的一致性和准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号