Effective heuristics for multiproduct partial shipment models

作     者：Dawande, M Gavirneni, S Tayur, S 

作者机构：Univ Texas Sch Management Richardson TX 75083 USA Cornell Univ Johnson Grad Sch Management Ithaca NY USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA 

出 版 物：《OPERATIONS RESEARCH》 (运筹学)

年 卷 期：2006年第54卷第2期

页      面：337-352页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：FREQUENCIES 

摘      要：Motivated by real applications, we consider the problem of shipping products to multiple customers from limited inventory. After formulating the optimization problems under different restrictions on partial shipments, we find that commercially available packages, applied directly, are unsatisfactory, as are simple greedy approaches. We develop a scheme of heuristics that enables the user to select a good balance between computation time and effectiveness. A detailed computational study of one- and two-period industrial-sized problems indicates that these heuristics are computationally practical and generate solutions that are, on average, within 3%-4% of the optimum.