An efficient search algorithm for obtaining the optimal replenishment strategies in assembly-type just-in-time supply chain systems
Ming-Jong Yao, Tien-Cheng Hsu (Taylor and Francis, 2018)
|
| An assembly-type just-in-time (JIT) supply chain system is composed of a main serial supply chain and several branching serial supply chains merging to the main supply chain. Under the assumption of constant demand rate, the replenishment problem in the assembly-type JIT supply chain systems can be formulated as a mixed-integer non-linear programming problem. We conduct thorough theoretical analysis on the properties of the objective function value curve in this study. Following our theoretical analysis, we propose a search algorithm that effectively solves an optimal solution. Our numerical experiments show that the average run time of the proposed algorithm grows in a linear order of the problem size, and the proposed algorithm may serve as an efficient solution approach for the decision-maker. |
| No. Panggil : | 658 JIPE 35:2 (2018) |
| Entri utama-Nama orang : | |
| Entri tambahan-Nama orang : | |
| Subjek : | |
| Penerbitan : | [Place of publication not identified]: Taylor and Francis, 2018 |
| Sumber Pengatalogan : | LibUI eng rda |
| ISSN : | 21681015 |
| Majalah/Jurnal : | JIPE |
| Volume : | Vol. 35, No. 2 March 2018: Hal. 118-128 |
| Tipe Konten : | text |
| Tipe Media : | unmediated |
| Tipe Carrier : | volume |
| Akses Elektronik : | |
| Institusi Pemilik : | Universitas Indonesia |
| Lokasi : | Perpustakaan UI, Lantai 4, R. Koleksi Jurnal |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| 658 JIPE 35:2 (2018) | 03-18-034780653 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20465218 |
