Name
Abstract | ||
|---|---|---|
In this paper, we consider a batch-sizing problem with multiple periods and multiple types of products that arises in the steel industry. In this problem, products of a product type are produced in series of stages to fulfill the demand. Each stage consists of a work-in-process storage with inventory capacity and a production machine with a production rate. It incurs an inventory cost in the work-in-process storage of a stage, and also incurs a setup cost whenever a production batch is formed in the first stage. The problem is to determine the formation of each production batch in each period such that the total cost of setup and inventory is minimized. For the problem, we first provide a mixed-integer quadratic programming model and then propose some optimality properties. Based on the proposed properties, we design an optimal algorithm to solve the problem in polynomial time. Finally, we report the performances of the mixed-integer quadratic programming model and the optimal algorithm based on actual production data. The computational results confirm the reliability and validity of the optimal algorithm. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.amc.2019.124830 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Batch-sizing,Multi-product,Optimal algorithm | Mathematical optimization,Product type,Multi product,Sizing,Quadratic programming,Time complexity,Total cost,Product (business),Inventory cost,Mathematics | Journal |
Volume | ISSN | Citations |
369 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Liu | 1 | 0 | 0.34 |
| Feng Li | 2 | 9 | 2.51 |
| Xianyan Yang | 3 | 0 | 0.68 |
| Shuang Qiu | 4 | 0 | 0.34 |