Lot sizing problems with strong set-up interactions |
| |
Authors: | STOWERS CURTIS L. PALEKAR UDATTA S. |
| |
Affiliation: | a Caterpillar Inc., Parts and Service Support Center, Morton, IL, USAb Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA |
| |
Abstract: | We address the problem of coordinated replenishment of products when the products can be produced only in fixed proportion to each other. Such problems commonly arise in the manufacture of sheet/plate metal parts or die-cast parts. The problem is a variant of the well-known Joint Replenishment Problem. We call this problem the Strong Interaction Problem (SIP). After giving a mathematical formulation of the problem, we show that the general problem is NP-hard. An important variant of the problem, in which products are unique to a family, is shown to be polynomially solvable. We present several lower bounds, an exact algorithm and a heuristic for the problem. Computational testing on randomly generated problems suggests that our exact algorithm performs very well when compared with a commercially available integer programming solver. The heuristic method also gives good solutions. |
| |
Keywords: | |
本文献已被 InformaWorld SpringerLink 等数据库收录! |
|