...
首页> 外文期刊>International Journal of Production Research >Auction-based cooperation mechanism for cell part scheduling with transportation capacity constraint
【24h】

Auction-based cooperation mechanism for cell part scheduling with transportation capacity constraint

机译:基于拍卖的具有运输能力约束的电池部件调度协作机制

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

摘要

This paper addresses cell part scheduling (CPS) problem with transportation capacity constraint. In the problem, parts may need to visit different cells, they have to be transferred by automated guided vehicle (AGV). The objective is to minimise the over-all process make-span. An integer nonlinear programming (INLP) model is formulated to allocate the machines, AGVs and schedule all parts. A reasonable transportation mode is presented, and an auction-based heuristic approach is proposed to solve the problem, which focuses on dealing with cooperation between machines and AGVs during processing and transferring parts. The auction consists of two aspects: auction for AGV and auction for machine. In both auctions, AGVs and machines act as auctioneers respectively, and parts act as bidders. A new improved disjunctive graph model is developed to optimise the feasible solutions obtained by auction-based approach. Numerical experiments were conducted to test the auction-based approach and improved disjunctive graph model. The results demonstrate the effectiveness of proposed auction-based approach and improved disjunctive graph model, also indicate influence of the capacity of AGV on scheduling parts.
机译:本文解决了具有运输能力约束的电池部件调度(CPS)问题。在此问题中,零件可能需要访问不同的单元,因此必须通过自动引导车(AGV)进行转移。目的是使整个过程的制造范围最小化。制定了整数非线性规划(INLP)模型来分配机器,AGV和调度所有零件。提出了一种合理的运输方式,并提出了一种基于拍卖的启发式方法来解决该问题,该方法着重于在零件加工和转移过程中处理机器与AGV的合作。拍卖包括两个方面:AGV拍卖和机器拍卖。在这两个拍卖中,AGV和机器分别充当拍卖人,零件充当投标人。开发了一种新的改进的分离图模型,以优化基于拍卖的方法获得的可行解。进行了数值实验,以测试基于拍卖的方法和改进的析取图模型。结果证明了基于拍卖的方法和改进的分离图模型的有效性,也表明了AGV的容量对调度零件的影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号