Inventory and Production Decisions for an Assemble-to-Order System with Uncertain Demand and Limited Assembly Capacity.

Operations Research (Impact Factor: 1.5). 12/2006; 54:1137-1150. DOI: 10.1287/opre.1060.0335
Source: DBLP

ABSTRACT Abstract This paper considers an inventory and production planning problem for a contract manu- facturer who anticipates an order of a single product but with uncertain quantity. To meet the challenges of long component procurement lead times and limited assembly capacity, which may render production time insucient,to assemble total order quantity, the manufacturer may need to procure components or even assemble some quantities of the final product before receiving the confirmation of the actual order quantity. We present profit-maximization models that make optimal inventory and production decisions in the above assemble-to-order environment. We also consider the option of outsourcing that the manufacturer can outsource part of his produc- tion to an external facility which also has limited capacity. We establish structural properties of optimal solutions and develop ecient,solution procedures for the proposed problems. We also provide sensitivity analysis of the optimal decisions and some managerial insights. Subject classifications: Inventory/production: assemble-to-order systems, component procure- ment lead times, demand uncertainty, capacity management, outsourcing. This research is supported in part by Hong Kong RGC Earmark Grant HKUST 6153/04E and the Doctoral Dis-

  • [Show abstract] [Hide abstract]
    ABSTRACT: Quick response for customer order with low cost is the key competitive factor for the contract manufacturer who assembles the customized capital device. We consider a problem for the contract manufacturer who receives forecast information from his customer before achieving the firm order. The firm order may be cancelled with some probability. The components have high probability of depreciation, they are all purchased for the current order. And the purchase lead times of the components are stochastic. The contract manufacturer must determine when to place the order for components. We present the total expected cost minimization model, including the components procurement costs, the holding cost, the tardiness penalty cost and the order cancellation cost. We establish structural properties of the optimal policy and prove that in some particular situation there is no need to purchase components before the order is confirmed. Numerical analysis illustrates how the model parameters affect the purchase lead times, the probability of delivery-on-time and total expected cost.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A new fossil species of Leguminosae is described from Neogene of northwest of Argentina. The good preservation of tissues and the diagnostic characters present in this fossil wood let assigning it to a new species of Gleditisioxylon Müller-Stoll and Madel. Gleditisioxylon riojana nov. sp. (Caesalpinoideae) has diagnostic features such as: growth rings distinct, semi-annular porosity, vestured pits, helical thickenings, simple plates, paratracheal parenchyma and rays 1-6 seriate. The possible climatic conditions of Toro Negro Formation were inferred by the use of xylological characters presents in this fossil wood. The presence of Gleditsioxylon added to other data, suggest a new hypothesis to explain the disjunction of Gleditsia L. genus and the occurrence of a single extant species in tropical and subtropical South America.
    Geobios 09/2011; · 1.19 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a Lagrangian based solution algorithm for the network design problem in a build-to-order (BTO) supply chain. The problem is to determine where to locate the distribution centers and to which distribution center or plant the retailers are assigned. The demand is assumed to be lead-time-dependent, and the balance between lead time and logistics costs is considered. Integer programming models are developed to formulate the problem. As it is difficult to obtain precisely optimal solution to this kind of problems, a Lagrangian based solution algorithm is developed to obtain near optimal solution. Problems involving hundreds of distribution centers and retailers are used to test the algorithm. Computational results show that the Lagrangian based algorithm can present very good solutions to all the examples in short CPU time. Scenario analyses and some managerial insights are reported.
    Advances in Engineering Software 07/2012; 49:21–28. · 1.42 Impact Factor