A hybrid general lot-sizing and scheduling formulation for a production process with a two-stage product structure

作     者：Transchel, Sandra Minner, Stefan Kallrath, Josef Loehndorf, Nils Eberhard, Ulrich 

作者机构：Penn State Univ Smeal Coll Business University Pk PA 16802 USA Univ Vienna Fac Business Econ & Stat A-1010 Vienna Austria BASF SE GVC S Sci Comp B009 D-67056 Ludwigshafen Germany BASF SE GRS PI J660 D-67056 Ludwigshafen Germany 

出 版 物：《INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH》 (国际生产研究杂志)

年 卷 期：2011年第49卷第9期

页      面：2463-2480页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0802[工学-机械工程] 

主　　题：lot-sizing scheduling mixed-integer programming reformulations process industry 

摘      要：Tailored for a complex application in the process industry, this article examines a multi-product production planning and scheduling problem with sequence-dependent setup cost and times. The manufacturing process is characterised by a two-stage structure where the sequencing problem occurs on the first level and contribution margin, holding cost, penalty cost are accounted on the second level. We present a hybrid mixed-binary optimisation model based on the general lot-sizing and scheduling problem [Fleischmann, B. and Meyr, H. 1997. The general lotsizing and scheduling problem. OR Spectrum, 19 (1), 11-21], which combines discrete and continuous-time elements within a standard inventory and lot-size (IL) formulation. Since the IL formulation does not provide sharp linear programming-relaxation bounds, we present two alternative reformulations based on a transportation problem. In a numerical study inspired by real industry data, we show that on average, both reformulations yield significant improvements in computation time and integrality gap.