Multiple Customers/Transporters Integrated Scheduling Problem to Minimize the Total Cost

被引：0
|
作者：
Hammoudan, Z. [1 ]
Ahmed, F. S. [2 ]
Grunder, O. [1 ]
El-Moudni, A. [1 ]
机构：
[1] UTBM, UBFC, IRTES SET, F-90010 Belfort, France
[2] Univ Lyon 1, Lab Automat & Genie Procedes, F-69622 Villeurbanne, France
来源：
IFAC PAPERSONLINE | 2016年 / 49卷 / 12期
关键词：
Integrated Scheduling; Delivery and Inventory; Multiple Customers; Branch and Bound; PRODUCTION-INVENTORY MODEL; SUPPLY CHAIN; FIXED-INTERVAL; SYSTEM;
D O I：
10.1016/j.ifacol.2016.07.888
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In tires paper, Multiple Customers/Transport Integrated Scheduling Problem is presented and analyzed. The objective is to minimize the total cost i.e. the delivery and inventory costs over the entire supply chain. Two methods of resolution are then presented and compared. The first one is a dedicated branch and bound, and the second one is commercial solver based on a MIP formulation of the considered problem. Their performances have been evaluated by comparing the resolution time required by each method as the number of transporter, customers and jobs increase. The experimental results show that the Branch and Bound algorithm I. is much more efficient than CPIJA solver for this problem. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All right reserved.
引用
下载
收藏
页码：892 / 897
页数：6
相关论文
共 50 条
  • [21] Simple heuristic to minimize total tardiness in a single machine scheduling problem
    R. Panneerselvam
    The International Journal of Advanced Manufacturing Technology, 2006, 30 : 722 - 726
  • [22] The two stage assembly flowshop scheduling problem to minimize total tardiness
    Allahverdi, Ali
    Aydilek, Harun
    JOURNAL OF INTELLIGENT MANUFACTURING, 2015, 26 (02) : 225 - 237
  • [23] SCHEDULING TO MINIMIZE INTERACTION COST
    CARLSON, RC
    NEMHAUSE.GL
    OPERATIONS RESEARCH, 1966, 14 (01) : 52 - &
  • [24] Job Scheduling to Minimize Total Completion Time on Multiple Edge Servers
    Fang, Xiaolin
    Cai, Zhipeng
    Tang, Wenyi
    Luo, Guangchun
    Luo, Junzhou
    Bi, Ran
    Gao, Hong
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (04): : 2245 - 2255
  • [25] Two-Agent Supply Chain Scheduling Problem to Minimize the Sum of the Total Weighted Completion Time and Batch Cost
    Yang L.-Y.
    Lu X.-W.
    Journal of the Operations Research Society of China, 2017, 5 (2) : 257 - 269
  • [26] Scheduling jobs on parallel machines to minimize a regular step total cost function
    Detienne, Boris
    Dauzere-Peres, Stephane
    Yugma, Claude
    JOURNAL OF SCHEDULING, 2011, 14 (06) : 523 - 538
  • [27] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ran Ma
    Jinjiang Yuan
    Journal of Combinatorial Optimization, 2017, 34 : 483 - 503
  • [28] Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
    He, Cheng
    Leung, Joseph Y. -T.
    Lee, Kangbok
    Pinedo, Michael L.
    DISCRETE APPLIED MATHEMATICS, 2016, 204 : 150 - 163
  • [29] Scheduling jobs on parallel machines to minimize a regular step total cost function
    Boris Detienne
    Stéphane Dauzère-Pérès
    Claude Yugma
    Journal of Scheduling, 2011, 14 : 523 - 538
  • [30] Online scheduling to minimize the total weighted completion time plus the rejection cost
    Ma, Ran
    Yuan, Jinjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 483 - 503
12345