Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Integrated Supply Chain Management via Randomized Rounding

Texto completo
Autor(es):
Pedrosa, Lehilton L. C. [1] ; Sviridenko, Maxim [2]
Número total de Autores: 2
Afiliação do(s) autor(es):
[1] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas, SP - Brazil
[2] Yahoo Labs, New York, NY 10022 - USA
Número total de Afiliações: 2
Tipo de documento: Artigo Científico
Fonte: INFORMS JOURNAL ON COMPUTING; v. 30, n. 1, p. 124-136, WIN 2018.
Citações Web of Science: 0
Resumo

We consider the supply chain problem of minimizing ordering, distribution, and inventory holding costs of a supply chain formed by a set of warehouses and retailers over a finite time horizon, which we call the production and distribution problem. This is a common generalization of the classical metric facility location problem and joint replenishment problem that coordinates the network design and inventory management decisions in an integrated manner. This coordination can represent significant economy for many applications, where network design and operational costs are normally considered separately. This problem is considered when the instances satisfy assumptions such as metric space of warehouse and retailer locations, and monotonic increasing inventory holding costs. In this work, we give a 2 : 77-approximation based on the randomized rounding of the natural mixed-integer programming relaxation. Also, we give a 5-approximation for the case that objective function includes retailer ordering setup costs. (AU)

Processo FAPESP: 12/17634-0 - Algoritmos avançados para alocação de recursos, gerência de estoque e outros problemas de cadeia de fornecimento
Beneficiário:Lehilton Lelis Chaves Pedrosa
Linha de fomento: Bolsas no Exterior - Estágio de Pesquisa - Doutorado