Multi-bucket optimization for integrated planning and scheduling in the perishable dairy supply chain

作     者：Sel, C. Bilgen, B. Bloemhof-Ruwaard, J. M. van der Vorst, J. G. A. J. 

作者机构：Dokuz Eylul Univ Dept Ind Engn TR-35397 Izmir Turkey Wageningen Univ Operat Res & Logist Grp NL-6706 KN Wageningen Netherlands 

出 版 物：《COMPUTERS & CHEMICAL ENGINEERING》 (计算机与化工)

年 卷 期：2015年第77卷

页      面：59-73页

核心收录：

学科分类：0817[工学-化学工程与技术] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Integrated planning and scheduling Mixed integer linear programming Constraint programming Hybrid approach Perishability Dairy supply chain 

摘      要：This paper considers a dairy industry problem on integrated planning and scheduling of set yoghurt production. A mixed integer linear programming formulation is introduced to integrate tactical and operational decisions and a heuristic approach is proposed to decompose time buckets of the decisions. The decomposition heuristic improves computational efficiency by solving big bucket planning and small bucket scheduling problems. Further, mixed integer linear programming and constraint programming methodologies are combined with the algorithm to show their complementary strengths. Numerical studies using illustrative data with high demand granularity (i.e., a large number of small-sized customer orders) demonstrate that the proposed decomposition heuristic has consistent results minimizing the total cost (i.e., on average 8.75% gap with the best lower bound value found by MILP) and, the developed hybrid approach is capable of solving real sized instances within a reasonable amount of time (i.e., on average 92% faster than MILP in CPU time). (C) 2015 Elsevier Ltd. All rights reserved.