Production Campaign Planning Under Learning and Decay

• 成果类型: Article
• 署名作者: Jahandideh, Hossein; Rajaram, Kumar; McCardle, Kevin
• 署名单位: University of California System; University of California Los Angeles
• 刊物名称: M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
• ISSN/ISSBN: 1523-4614
• DOI: 10.1287/msom.2018.0766
• 发表日期: 2020
• 页码: 615-632
• 关键词: campaign planning; batch production; stochastic economic lot sizing problem; Bayesian updating; production learning; semi-Markov processes; stochastic dynamic programming

摘要

Problem definition: We analyze a catalyst-activated batch-production process with uncertainty in production times, learning about catalyst-productivity characteristics and decay of catalyst performance across batches. The goal is to determine the quality level of batches and to decide when to replenish a catalyst so as to minimize average costs, consisting of inventory-holding, backlogging, and catalyst-switching costs. Academic/ practical relevance: This is an important problem in a variety of process-industry sectors, such as food processing, pharmaceuticals, and specialty chemicals, but has not been adequately studied in the academic literature. This paper also contributes to the stochastic economic lot-sizing literature. Methodology: We formulate this problem as a semi-Markov decision process (SMDP) and develop a two-level heuristic to solve this problem. The heuristic consists of a lower-level problem that plans the duration of batches within the current campaign to maximize the efficiency of the catalyst while ensuring that the target attribute level for each batch is set to meet a quality specification represented by an average attribute level across all the batches in a campaign. The higher-level problem determines when to replace the costly catalyst as its productivity decays. To evaluate our heuristic, we present a lower bound on the optimal value of the SMDP. This bound accounts for all costs, as well as the randomness and discreteness in the process. We then extend our methods to multiple-product settings, which results in an advanced stochastic economic lot-sizing problem. Results: We test our proposed solution methodology with data from a leading food-processing company and show that our methods outperform current practice with an average improvement of around 22% in costs. In addition, compared with the stochastic lower bounds, our results show that the two-level heuristic attains near-optimal performance for the intractable multidimensional SMDP. Managerial implications: Our results generate three important managerial insights. First, our simulation-based lower bound provides a close approximation to the optimal cost of the SMDP, and it is nearly attainable by using a relatively simple two-level heuristic. Second, the reoptimization policy used in the lower-level problem adequately captures the value of information and Bayesian learning. Third, in the higher-level problem of choosing when to replace a catalyst, the intractable multidimensional state of the system is efficiently summarized by a single statistic: the probability of inventory falling below a specific threshold.