A study on production lot-sizing in MRP system. (2nd report. Multi-item lot-sizing by group technology).

For a multi-unit system subject to stochastic degradation failure, the maintenance performed on any component usually incurs a common system setup cost, regardless of the number of components being maintained. Therefore, whenever a component undergoes the maintenance, there is an opportunity to conduct preventive maintenance (PM) on other components even though their degradation does not exceed their own PM thresholds. Thus, simultaneously conducting PM on multiple components can pontential reduce total setup costs, realizing maintenance saving over a long run. Though multi-component maintenance planning has received much attentions in the past decades, most decision models are built upon individual components, such as block-based maintenance and periodic inspection/replacement policy. In this paper, we propose an opportunistic maintenance policy that adaptively adjusts the inspection interval, and the thresholds of PM and opportunistic maintenance based on the degradation of all components. A simulation model is developed to minimize the long-run cost rate by considering the costs associated with inspection, setup, and maintenance actions. Finally, the numerical examples are provided to demonstrate how to optimize the opportunistic maintenance threshold under different setup cost, PM overhead, and reliability parameters.

Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems

In this study, we investigated the time-varying capacitated lot-sizing problem under a fast-changing production environment, where production factors such as the setup costs, inventory-holding costs, production capacities, or even material prices may be subject to continuous changes during the entire planning horizon. Traditional lot-sizing theorems and algorithms, which often assume a constant production environment, are no longer fit for this situation. We analyzed the time-varying environment of today’s agile enterprises and modeled the time-varying setup costs and the time-varying production capacities. Based on these, we presented two mixed-integer linear programming models for the time-varying capacitated single-level lot-sizing problem and the time-varying capacitated multi-level lot-sizing problem, respectively, with considerations on the impact of time-varying environments and dynamic capacity constraints. New properties of these models were analyzed on the solution’s feasibility and optimality. The solution quality was evaluated in terms of the entropy which indicated that the optimized production system had a lower value than that of the unoptimized one. A number of computational experiments were conducted on well-known benchmark problem instances using the AMPL/CPLEX to verify the proposed models and to test the computational effectiveness and efficiency, which showed that the new models are applicable to the time-varying environment. Two of the benchmark problems were updated with new best-known solutions in the experiments.

The aim of this paper is to present a branch and bound approach to solve a k-stage hybrid flowshop scheduling problem in order to minimize the total completion time. This scheduling problem encloses three subproblems: lot sizing, scheduling and assignment problems. In this paper only scheduling and assignment are taken into account because we suppose that the lot sizing problem has already been solved. The method we propose is an optimal method, based on a special architecture of search tree which allows us to solve the two subproblems considered. Some lower bounds are proposed. Then computational results are given and proved that results are acceptable. Finally, two theorems demonstrate some dominance relations.

The determination of lot sizes and production schedules of multiple products in multiple periods is difficult when sequence-dependent set-up costs are present. By using an initial set-up cost estimator (ISCE) the joint problem can be divided and solved sequentially. A search of the literature reveals that, while there is considerable research on the individual problems of lot sizing and scheduling, there is a dearth of study on either the joint problem or on the effect of ISCE selection on the total cost solution. Using a variety of data sets, this paper evaluates the sensitivity of ISCE selection on the solution to the joint problem. Results of the study demonstrate that the choice of an ISCE can have a significant effect on the final lot sizes and schedules. Additionally, the research shows that ‘common sense’ a priori assumptions about ISCE performance may lead to the selection of an inappropriate ISCE.

This paper derives a mathematical integrated production inventory model of single vendor and buyer to investigate the effects of capital investment in setup cost of the vendor and order processing cost of the buyer on the decision variables of the model. Main purpose of this study is to minimize the integrated total cost of the vendor and buyer by optimizing the delivery lot size, lead-time, setup and order processing cost and number of deliveries per order simultaneously while lead-time demand follows normal distribution and unknown distribution, i.e., distribution free case. This model is analyzed by calculus method and justified with appropriate numerical illustrations. Numerical results show that significant savings can be achieved at optimal investments in reducing lead time, ordering cost and setup cost. Finally, sensitivity analysis of the key parameters is carried out and some managerial implications are also included.

In this study, we investigate a continuous review inventory model to reduce lead time, yield variability and setup cost simultaneously through capital investments. We assume that the backorder rate is depending on the length of the lead time through the amount of shortages. We also assume that lead time demand's distribution is not known but its first and second moments are known. We apply minimax distribution free procedure to minimise the expected total annual cost. By using logarithmic investment function we describe the relationship between the reduction in lead time, yield variability and setup cost with capital investment. This function was used in many existing models. Our main aim is to determine the optimal capital investment and ordering policies that minimises the expected total annual cost. To find out the optimal solution, an algorithm is given. With the help of this algorithm, optimal capital investment and ordering policies are wrought out. Numerical examples are given to elucidate the model. Our proposed model greatly differs from the model existing in the literature (the model by Lin and Hou (2005)) viz: (1) In the above model, yield variability and setup cost were reduced through capital investment. In our model we reduce yield variability setup cost and also the lead time, which plays a vital role in any business. By reducing lead time we can improve the service level to the customer so as to increase the competitive edge in business. (2) In the model (the model by Lin and Hou (2005)), it was assumed that lead time demand follows normal distribution. But in our model we take the distribution of lead time demand as distribution free. That is, it can follow any distribution which is more general. (3) In the above model (the model by Lin and Hou (2005)), shortages are completely backlogged. But we consider partial backlogging and take the backlogging rate as 0 ≤ B ≤ 1. If we set backlogging rate B = 1 we get the above model. That is, the above model is particular case of our model. (4) We also assume that the backorder rate depends on the length of the lead time through the amount of shortages. If the lead time is longer then shortage accumulation is higher. The patience of customers will result in failure in business since some customers may turn to some other supplier. Hence, the backorder rate will be reduced. This assumption is very realistic.

A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs

We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is (i) non-speculative or Wagner–Whitin (for instance, constant unit production costs and non-negative unit holding costs) and (ii) the production set-up costs are non-increasing over time, it is known that the minimum cost lot-sizing problem is polynomially solvable using dynamic programming. When the capacities are non-decreasing, we derive a compact mixed integer programming reformulation whose linear programming relaxation solves the lot-sizing problem to optimality when the objective function satisfies (i) and (ii). The formulation is based on mixing set relaxations and reduces to the (known) convex hull of solutions when the capacities are constant over time. We illustrate the use and potential effectiveness of this improved LP formulation on a few test instances, including instances with and without Wagner–Whitin costs, and with both non-decreasing and arbitrary capacities over time.

The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation

A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure

The lot‐sizing problem in capacitated multi‐stage systems with a serial product structure is addressed. This is a complex optimization problem that is part of the decision set in material requirements planning (MRP) systems. The mathematical model that describes the problem uses the concept of echelon stock and includes lead times. Setup times are taken into account, which implies that the problem of finding a feasible solution is NP‐Complete. This paper proposes a heuristic method that provides a production plan in order to minimize inventory, production, and setup costs. The heuristic starts from a solution for the uncapacitated problem, which is given by the sequential application of the Wagner‐Whitin algorithm. Feasibility is then attempted by shifting production amounts between periods. Computational tests conducted in 1,800 instances with up to 40 components and 18 periods have shown that feasible solutions were obtained in 83.7% of the instances. For the infeasible instances, on average, the heuristic is able to find solutions with very low capacity excess. The solutions' quality is evaluated through a lower bound provided by Lagrangean relaxation and on average the gap is less than 10%.

The aim of this work was to study a distribution and lot-sizing problem that considers costs with transportation to a company warehouse as well as, inventory, production and setup costs. The logistic costs are associated with necessary containers to pack produced items. The company negotiates a long-term contract in which a fixed cost per period is associated with the transportation of the items. On the other hand, a limited number of containers are available with a lower cost than the average cost. If an occasional demand increase occurs, other containers can be utilized; however, their costs are higher. A mathematical model was proposed in the literature and solved using the Lagrangian heuristic. Here, the use of the Lagrangian/surrogate heuristic to solve the problem is evaluated. Moreover, an extension of the literature model is considered adding capacity constraints and allowing backlogging. Computational tests show that Lagrangian/surrogate heuristics are competitive, especially when the capacity constraints are tight.

A memetic algorithm for a multistage capacitated lot-sizing problem

A network flow model for the capacitated lot-sizing problem