947 resultados para inbound logistics
Resumo:
Supersedes FM 38-8, dated Oct. 17, 1966.
Resumo:
Consists of reprints of previously published articles.
Resumo:
Volume I, with the title, The logistics of blood transfusion therapy, is the proceedings of the first two symposia presented in 1974-75; volume II is the proceedings of the 1977 conference.
Resumo:
Mode of access: Internet.
Resumo:
Reprint of the 1986 ed.
Resumo:
Mode of access: Internet.
Resumo:
Includes index.
Resumo:
Mode of access: Internet.
Resumo:
Report covers fiscal year.
Resumo:
Mode of access: Internet.
Resumo:
At head of title: Assistant Secretary of Defense.
Resumo:
Warranty is an important element of marketing new products. The servicing of warranty results in additional costs to the manufacturer. Warranty logistics deals with various issues relating to the servicing of warranty. Proper management of warranty logistics is needed not only to reduce the warranty servicing cost but also to ensure customer satisfaction as customer dissatisfaction has a negative impact on sales and revenue. Unfortunately, warranty logistics has received very little attention. The paper links the literature on warranty and on logistics and then discusses the different issues in warranty logistics. It highlights the challenges and identifies some research topics of potential interest to operational researchers. (C) 2003 Elsevier B.V. All rights reserved.
Resumo:
Physical distribution plays an imporant role in contemporary logistics management. Both satisfaction level of of customer and competitiveness of company can be enhanced if the distribution problem is solved optimally. The multi-depot vehicle routing problem (MDVRP) belongs to a practical logistics distribution problem, which consists of three critical issues: customer assignment, customer routing, and vehicle sequencing. According to the literatures, the solution approaches for the MDVRP are not satisfactory because some unrealistic assumptions were made on the first sub-problem of the MDVRP, ot the customer assignment problem. To refine the approaches, the focus of this paper is confined to this problem only. This paper formulates the customer assignment problem as a minimax-type integer linear programming model with the objective of minimizing the cycle time of the depots where setup times are explicitly considered. Since the model is proven to be MP-complete, a genetic algorithm is developed for solving the problem. The efficiency and effectiveness of the genetic algorithm are illustrated by a numerical example.