Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints
This paper considers the problem of minimising total average cycle stock that is subject to practical constraints, as first studied by Silver and Moon and later by Hsieh, and Billionnet. For the problem, reorder intervals of a population of items are restricted to a given set, and the total number o...
Saved in:
| Published in: | The Journal of the Operational Research Society Vol. 71; no. 8; pp. 1301 - 1305 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Taylor & Francis
02.08.2020
|
| Subjects: | |
| ISSN: | 0160-5682, 1476-9360 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper considers the problem of minimising total average cycle stock that is subject to practical constraints, as first studied by Silver and Moon and later by Hsieh, and Billionnet. For the problem, reorder intervals of a population of items are restricted to a given set, and the total number of replenishments allowed per unit time is limited. Previous researchers proposed different mathematical programming formulations and relaxation methods without identifying the computational complexity of the problem. In this study, we investigate the computational complexity of the problem and analyse the proposed relaxation methods. We identify NP-hard and polynomial time solvable cases of the problem and compare three different relaxations in terms of the lower bounds provided by each relaxation method. We also show that the relaxation with the strongest bound can be solved using a linear time greedy algorithm instead of a general-purpose linear programming algorithm. |
|---|---|
| ISSN: | 0160-5682 1476-9360 |
| DOI: | 10.1080/01605682.2019.1609879 |