经济批量排产问题的一种排产方法

针对经济批量排产问题假定生产可以在库存降为0之前开始,并且提出新的算法求产品的生产顺序。结果表明,该排产方法成本要低于其他2种常用的经济批量排产问题的方法,并且给出了算法的时间复杂性。     

PRODUCTION SCHEDULING OF CONTINUOUS FLOW LINES: MULTIPLE PRODUCTS WITH SETUP TIMES AND COSTS

The problem of production planning and setup scheduling of multiple products on a single facility is studied in this paper. The facility can only produce one product at a time. A setup is required when the production switches from one type of product to another. Both setup times and setup costs are considered. The objective is to determine the setup schedule and production rate for each product that minimize the average total costs, which include the inventory, backlog, and setup costs. Under the assumption of a constant production rate, we obtain the optimal cyclic rotation schedule for the multiple products system. Besides the decision variables studied in the classical economic lot scheduling problem (ELSP), the production rate is also a decision variable in our model. We prove that our solutions improve the results of the classical ELSP.     

Integrative Cycle Scheduling Approach for a Capacitated Flexible Assembly System*

This study revisits the traditional single stage, multi-item, capacitated lot-sizing problem (CLSP) with a new integrative focus on problem structuring. Unlike past research, we develop integrative cycle scheduling approaches which simultaneously address lot-sizing, capacity, and sequencing issues. Our purposes are to (1) explore the effect of sequencing on inventory levels, (2) examine the problem of infeasibility in the economic lot scheduling problem (ELSP), and (3) provide a simple methodology of generating low-cost cycle schedules in an environment with discrete shipping, dynamic demands, limited capacity, zero setup cost, and sequence-independent setup times. Our procedures are compared to benchmark cycle scheduling approaches in terms of both inventory cost and computation time under different demand scenarios, using the operating data from a flexible assembly system (FAS) at the Ford Motor Company's Sandusky, Ohio plant.     

Multi-product lot scheduling with backordering and shelf-life constraints

In this paper, we revisit the economic lot scheduling problem (ELSP), where a family of products is produced on a single machine, or facility, on a continual basis. Our focus is on the determination of a feasible production schedule, including the manufacturing batch size of each item. We assume that total backordering is permissible and that each of the products has a limited post-production shelf life. Several studies examining this problem have suggested a rotational common cycle approach, where each item is produced exactly once every cycle. To ensure schedule feasibility, we resort to the technique of reducing individual production rates and allow the flexibility of producing any item more than once in every cycle, in conjunction with appropriate timing adjustments. In order to solve this more generalized model, which is NP hard, we suggest a two-stage heuristic algorithm. A numerical example demonstrates our solution approach.     

Multi-echelon supply chain network design in agile manufacturing

In this paper, we consider a supply chain network design problem in an agile manufacturing scenario with multiple echelons and multiple periods under a situation where multiple customers have heavy demands. Decisions in our supply chain design problem include selection of one or more companies in each echelon, production, inventory, and transportation. We formulate the problem integrating all decisions to minimize the total operational costs including fixed alliance costs between two companies, production, raw material holding, finished products holding, and transportation costs under production and transportation capacity limits. A Lagrangian heuristic is proposed in this paper. Optimizing a Lagrangian relaxation problem provides a lower bound, while a feasible solution is generated by adjustment techniques based on the solution of subproblems at each iteration. Computational results indicate the high quality solutions with less than 5% optimality gap are provided quickly by the approach in this paper. Further, compared to initiative managerial alternatives, an improvement of 15% to 25% is not unusual in certain cases for the proposed approach.     

The Individually Responsible and Rational Decision Approach to Economic Lot Sizes for One Vendor and Many Purchasers

Banerjee's [2] joint economic lot size (JELS) model, along with related works by Monahan [12] and Lal and Staelin [10], represents one approach to minimizing the total inventory carrying and ordering costs of a vendor and his purchaser(s). Noting that JELS philosophy requires a coordinated system and that its practical implementation is problematic, we present an alternative approach to the same problem: the individually responsible and rational decision (IRRD) approach. The IRRD approach is consistent with a free enterprise system and easy to implement. In order to show that the IRRD approach is also more economical than the JELS approach, we first build a more refined JELS model for the case of one vendor and many identical purchasers. Drawing on earlier criticisms of specific JELS models, our refinement relaxes the lot-for-lot assumption commonly used by JELS scholars. To be comparable with earlier works, we retain the assumption of deterministic conditions and demonstrate the economic advantages of IRRD over JELS through a numerical example. An algebraic proof of IRRD's superiority over JELS is offered in the more general and realistic case of a vendor dealing with K nonidentical purchasers with reasonably predictable annual demand but uncertain order quantities and timings.     

Multi-echelon supply chain network design in agile manufacturing

In this paper, we consider a supply chain network design problem in an agile manufacturing scenario with multiple echelons and multiple periods under a situation where multiple customers have heavy demands. Decisions in our supply chain design problem include selection of one or more companies in each echelon, production, inventory, and transportation. We formulate the problem integrating all decisions to minimize the total operational costs including fixed alliance costs between two companies, production, raw material holding, finished products holding, and transportation costs under production and transportation capacity limits. A Lagrangian heuristic is proposed in this paper. Optimizing a Lagrangian relaxation problem provides a lower bound, while a feasible solution is generated by adjustment techniques based on the solution of subproblems at each iteration. Computational results indicate the high quality solutions with less than 5% optimality gap are provided quickly by the approach in this paper. Further, compared to initiative managerial alternatives, an improvement of 15% to 25% is not unusual in certain cases for the proposed approach.     

A Heuristic Algorithm for the Capacitated Multiple Supplier Inventory Grouping Problem

This paper presents and solves a model for the multiple supplier inventory grouping problem, which involves the minimization of logistics costs for a firm that has multiple suppliers with capacity limitations. The costs included in the model are purchasing, transportation, ordering, and inventory holding, while the firm's objective is to determine the optimal flows and groups of commodities from each supplier. We present an algorithm, which combines subgradient optimization and a primal heuristic, to quickly solve the multiple supplier inventory grouping problem. Our algorithm is tested extensively on problems of various sizes and structures, and its performance is compared to that of OSL, a state-of-the-art integer programming code. The computational results indicate that our approach is extremely efficient for solving the multiple supplier inventory grouping problem.     

A PRESENT VALUE FORMULATION OF THE CLASSICAL EOQ PROBLEM*

The usual analysis of the deterministic economic order quantity problem seeks to minimize the average cost of inventory ordering and holding costs per unit time. An alternative approach described in this paper examines the present value of discounted costs over an infinite horizon. Differences in the solutions and implications of errors using the two methodologies are discussed.     

A Note on the Effect of Sudden Obsolescence on the Optimal Lot Size

In most management situations, the decision to hold inventory involves some element of obsolescence risk The traditional approach to this problem, in both theory and practice, is to incorporate obsolescence costs in the inventory holding cost. This note explores this issue and demonstrates that the traditional approach is appropriate for items subject to sudden obsolescence; that is, for items with demand lifetimes that are exponentially distributed.     

EMPIRICAL INVENTORY SIMULATION: A CASE STUDY*

An empirical simulation was used to investigate the economics of minimum-buy policies in the U.S. Army management of spare-parts inventory. An empirical simulation makes use of historical data as direct input to the simulation rather than randomly generated data based on a characterization of the historical data. Empirical simulation alleviates the drawbacks of characterizing historical data with a theoretical distribution; however, because steady-state conditions are not reached, a methodological problem arises in the evaluation of inventory assets at the end of the simulation. Our solution was to minimize this problem by use of a cyclic approach.     

Integrated Procurement Planning in Multi‐division Firms

For large multi‐division firms, coordinating procurement policies across multiple divisions to leverage volume discounts from suppliers based on firm‐wide purchasing power can yield millions of dollars of savings in procurement costs. Coordinated procurement entails deciding which suppliers to use to meet each division's purchasing needs and sourcing preferences so as to minimize overall purchasing, logistics, and operational costs. Motivated by this tactical procurement planning problem facing a large industrial products manufacturer, we propose an integrated optimization model that simultaneously considers both firm‐wide volume discounts and divisional ordering and inventory costs. To effectively solve this large‐scale integer program, we develop and apply a tailored solution approach that exploits the problem structure to generate tight bounds. We identify several classes of valid inequalities to strengthen the linear programming relaxation, establish polyhedral properties of these inequalities, and develop both a cutting‐plane method and a sequential rounding heuristic procedure. Extensive computational tests for realistic problems demonstrate that our integrated sourcing model and solution method are effective and can provide significant economic benefits. The integrated approach yields average savings of 7.5% in total procurement costs compared to autonomous divisional policies, and our algorithm generates near‐optimal solutions (within 0.75% of optimality) within reasonable computational time.     

A simple integrated production policy of an imperfect item for vendor and buyer

This article develops a simple approach for determining an optimal integrated vendor–buyer inventory policy for an item with imperfect quality. The objective is to minimize the total joint annual costs incurred by the vendor and the buyer. This model is assumed to produce a certain number of defective items during the production process. Items of poor quality detected in the screening process of a lot are sold at a discounted price. The expected annual integrated total cost function is derived and a solution procedure is proposed to determine the optimal policy. Finally, a numerical example is also given to illustrate the solution procedure presented in this article.     

An interactive decision support system for an aggregate production planning model based on multiple criteria mixed integer linear programming

In this paper, we present an aggregate production planning (APP) model applied to a Portuguese firm that produces construction materials. A multiple criteria mixed integer linear programming (MCMILP) model is developed with the following performance criteria: (1) maximize profit, (2) minimize late orders, and (3) minimize work force level changes. It includes certain operational features such as partial inflexibility of the work force, legal restrictions on workload, work force size (workers to be hired and downsized), workers in training, and production and inventory capacity. The purpose is to determine the number of workers for each worker type, the number of overtime hours, the inventory level for each product category, and the level of subcontracting in order to meet the forecasted demand for a planning period of 12 months. Additionally, a decision support system (DSS) based on the MCMILP model is proposed. It will help practitioners find the “best” solution for an APP problem without having to familiarize themselves with the mathematical complexities associated with the model. An example to illustrate the use of the DSS is also included.     

Economic Manufacturing Quantity and Its Integrating Implications

Several contradictions are noted among the Economic Order Quantity (EOQ), Just‐In‐Time (JIT), and Optimized Production Technology (OPT) approaches and the economic framework for profit maximization. A fundamental model referred to as the Economic Manufacturing Quantity (EMO) is developed and examined for its integrating implications for the three approaches. An implication for the classic EOQ approach is that the balance between setup and inventory carrying costs is valid when a production facility is operating at or below a certain critical level but not when operating above that level. An implication for the JIT approach is that one must reduce setup cost at non‐bottlenecks and setup time at bottlenecks to reduce inventory. An implication for the OPT approach is that trade‐offs between setup and inventory carrying costs may indeed be ignored while determining process batch sizes, provided each facility in a production system is operating at or above Its critical level. Economic theoretic analysis of the EMO model provides a basis for unification of JIT which advocates stability in operating level as a key to improved productivity and quality, and OPT that advocates maximizing operating level with resultant emphasis on bottlenecks as a key to increased profits. This unifying basis states that a profit‐maximizing production facility or system will operate at the full and stable level as long as market demand remains relatively sensitive to price and operating at the full (maximum) level provides positive unit contribution.     

Modellgestützte Flexibilitätsanalyse von Strategien zur Ersatzteilversorgung in der Nachserienphase

An important task in after sales service is the provision of spare parts for durables. Due to its nature and dependence on earlier sales, the demand for spare parts is inherently dynamic and uncertain requiring for high procurement flexibility. During the product life cycle, inventory management of spare parts is performed efficiently under use of flexibility provided by existing production facilities. This situation completely changes once the OEM ceases production of the parent product. A prime option of procuring spare parts for the End-of-production period is to place a final order for parts when regular production ends. Besides low unit production costs, this option does not contain any flexibility, yielding a high risk of obsolescence of stored parts, and at the same time a high risk of not being able to satisfy all demand during the service period. In order to increase flexibility further options like extra production at higher unit cost or remanufacturing of components taken from used products could be used. After introducing the problem and a basic quantitative model, we evaluate flexibility properties of strategies using different combinations of the above options. In doing so we distinguish between quantity, time, and stock related flexibility. In a comprehensive numerical study it is investigated to which extent flexibility properties of the different strategies can contribute to their economic profitability.     

Multi-product batch production on a single machine—A problem revisited

When several products are processed one at a time on a single machine, the conventional approach of computing the economic batch quantity for each product cannot apply. An example for six products is considered, where the total production capacity on regular time is inadequate, so that overtime has to be used at an extra cost. A simple method is described for solving this problem when each product is produced once during a production cycle, the objective being to minimize the total set-up and holding costs per day. Schedules which involve batch splitting can reduce these costs further, and a guideline is proposed for the construction of sub-cycles. The results compare favourably with lower bounds computed for the purpose.     

The disassembly line: balancing and modeling,by S.M. McGovern and S.M. Gupta

This note addresses a problem faced by an actual firm. The problem is to decide on the optimal level of product quality. In performing the economic analysis to determine product quality level, the firm considers revenue, production costs, and research and development costs. However, this note shows that ignoring inventory costs in the analysis will lead to suboptimal product quality levels. Also, including inventory costs in the analysis will lead to reduced production lot sizes. Numerical examples are used to illustrate the results of the model.     

Time window capacity analysis for synchronous production

Synchronous production is a philosophy that suggests that the right part should arrive at the right machine at the right time to minimize the inventory and operating costs. To achieve this goal a synchronous material flow is required. How ever, this is not an easy task in the discrete manufacturing environment because it requires management commitment and algorithmic development. This paper proposes a time window capacity analysis (TWCA) approach to implement the synchronous production. By dividing the production time into small time windows, simple rules, heuristics and algorithms are developed to assign operations among available resources such that the inventory and operating costs are kept low. The synchronization is achieved by resolving the demands of each operation in the order of time windows. The approach is simple and has been implemented and tested in an actual manufacturing company. The results show that TWCA is practical and promising. TWCA has the potential to be used in either single, multiple, or parallel machines, one stage or multi-stage, job shops or flow shops, and closed or open systems.