A hierarchical heuristic algorithm for multi-objective order allocation problem subject to supply uncertainties
In this paper, a hierarchical heuristic algorithm is proposed to allocate order quantities to suppliers and determine the best lot sizing for each supplier. Pre-defined policies are first implemented to generate the initial order allocation to suppliers. The solutions are then modified by reducing t...
Uložené v:
| Vydané v: | Journal of industrial and production engineering Ročník 40; číslo 5; s. 343 - 359 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Abingdon
Taylor & Francis
04.07.2023
Taylor & Francis Ltd |
| Predmet: | |
| ISSN: | 2168-1015, 2168-1023 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | In this paper, a hierarchical heuristic algorithm is proposed to allocate order quantities to suppliers and determine the best lot sizing for each supplier. Pre-defined policies are first implemented to generate the initial order allocation to suppliers. The solutions are then modified by reducing the gap of the least satisfying level to search for a compromised solution, and this process is repeated until no further improvement can be made. The fine-tuning process finally reduces the gap between the two consecutive order allocation schemes. In the second level, a dynamic programming approach is modified to determine the best lot-sizing plan and compensate for the loss of quality and late delivery. The contributions of this work are to develop not only the best order allocation plan instead of supplier selection but also effective lot sizing plan that can reduce supply uncertainties. Experiments are tested to confirm the performance of the proposed method. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2168-1015 2168-1023 |
| DOI: | 10.1080/21681015.2023.2200611 |