A Simple Heuristic for Lot Sizing with Setup Times

This paper presents an easily understood and computationally efficient heuristic algorithm for the capacitated lot sizing problem (CLSP), the single machine lot-sizing problem, with nonstationary costs, demands, and setup times. The algorithm solves problems with setup time or setup cost. A variation of the algorithm can solve problems when limited amounts of costly overtime are allowed. Results of experimentation indicate that the most significant effects on solution quality are due to the level of setup costs relative to holding costs and the size of the problems as determined by the number of items. Also affecting solution quality are tightness of the capacity constraint and variability of demand in a problem. When the capacity constraint is extremely tightly binding, it sometimes has difficulty finding solutions that do not require overtime.     

PROCEDURES FOR DETERMINING RELATIVE FREQUENCIES OF PRODUCTION/ORDER IN MULTISTAGE ASSEMBLY SYSTEMS*

We show that the problems of determination lot sizes in a multistage assembly system for the case of instantaneous production and constant demand for the end item can be reduced to the problems of determining relative frequenceis of production/order for items at each production stage. We further show that such frequencies are independent of the demand levels. Optimal and near-optimal solution procedures for this reduced problem are provided. The near-optimal procedure successively treats each stage of production as a final production stage while simulatenously incorporating decisions made at lower stages into decisions made at higher stages. Experimental results show that the near-optimal procedure results in optimal solutions 75 percent of the time and performs considerably better than representative heuristics available in the literature. Further, its performance is relatively less susceptible to product/structural characteristics of the system.     

WIP inventories in the simultaneous determination of optimal production and purchase lot sizes

This paper studies an integrated production and purchasing lot sizing model with work-in-process WIP inventory. In this model, the single product is made in a multiprocess manufacturing system. The raw materials are procured from outside sources and are converted gradually into the product. A solution procedure is developed to simultaneously find the optimal lot sizes for the product and its raw materials and the corresponding total relevant cost. It is shown that if the cost of WIP inventory is considered in the production lot size computation, the optimal lot sizes of the product as well as those of the raw materials could be altered significantly.     

Coordinating replenishments in a supply chain with quality control considerations

We study the impact of coordinated replenishment, a popular supply chain initiative, on a quality control system. We use the (Q, S) policy to manage a two-item inventory control system. If the items are jointly replenished, the number ordered for each item varies from lot to lot. As the number varies, the sampling plan will also be changed. Companies have to determine sampling plans to minimize quality cost when the order is mixed with several items and the number of each item varies from order to order. Management's primary concern is to determine the optimal sampling sizes and acceptance numbers for all items in an order.     

Coordinated Capacitated Lot‐Sizing Problem with Dynamic Demand: A Lagrangian Heuristic

Coordinated replenishment problems are common in manufacturing and distribution when a family of items shares a common production line, supplier, or a mode of transportation. In these situations the coordination of shared, and often limited, resources across items is economically attractive. This paper describes a mixed‐integer programming formulation and Lagrangian relaxation solution procedure for the single‐family coordinated capacitated lot‐sizing problem with dynamic demand. The problem extends both the multi‐item capacitated dynamic demand lot‐sizing problem and the uncapacitated coordinated dynamic demand lot‐sizing problem. We provide the results of computational experiments investigating the mathematical properties of the formulation and the performance of the Lagrangian procedures. The results indicate the superiority of the dual‐based heuristic over linear programming‐based approaches to the problem. The quality of the Lagrangian heuristic solution improved in most instances with increases in problem size. Heuristic solutions averaged 2.52% above optimal. The procedures were applied to an industry test problem yielding a 22.5% reduction in total costs.     

A new EPQ model: integrating lower pricing,rework and reject situations

The economic production quantity (EPQ) is a well-known and commonly used inventory control technique. It has been used for well over 50 years to optimize lot sizes in transportation/production. The standard results are easy to apply but are based on a number of assumptions. A common assumption in the EPQ model is that all units produced are of perfect quality, this will underestimate the actual required quantity. Many researchers have studied the effects after relaxing this assumption on the EPQ model. The previous studies had considered that imperfect quality and defective items are either to be reworked instantaneously and kept in stock or rejected at a cost. The objective of this paper is to provide a framework to integrate lower pricing, rework and reject situations into a single EPQ model. A 100% inspection is performed in order to identify the amount of good quality items, imperfect quality items and defective items in each lot. This model assumes that items of imperfect quality, not necessarily defective, could be used in another production situation or sold to a particular purchaser at a lower price. The electronic and clothing industries give good examples for such situations. A mathematical model is developed and a numerical example is presented to illustrate the solution procedures. It is found that the time factor of when to sell the imperfect items is critical, as this decision will affect the inventory cost and the batch quantities.     

CAPACITY AND PRODUCTION DECISIONS IN STOCHASTIC MANUFACTURING SYSTEMS: AN ASYMPTOTIC OPTIMAL HIERARCHICAL APPROACH

We present a new paradigm of hierarchical decision making in production planning and capacity expansion problems under uncertainty. We show that under reasonable assumptions, the strategic level management can base the capacity decision on aggregated information from the shopfloor, and the operational level management, given this decision, can derive a production plan for the system, without too large a loss in optimality when compared to simultaneous determination of optimal capacity and production decisions. The results are obtained via an asymptotic analysis of a manufacturing system with convex costs, constant demand, and with machines subject to random breakdown and repair. The decision variables are purchase time of a new machine at a given fixed cost and production plans before and after the purchase. The objective is to minimize the discounted costs of investment, production, inventories, and backlogs. If the rate of change in machine states such as up and down is assumed to be much larger than the rate of discounting costs, one obtains a simpler limiting problem in which the random capacity is replaced by its mean. We develop methods for constructing asymptotically optimal decisions for the original problem from the optimal decisions for the limiting problem. We obtain error estimates for these constructed decisions.     

A generic accounting model to support operations management decisions

Information systems are generally unable to generate information about the financial consequences of operations management decisions. This is because the procedures for determining the relevant accounting information for decision support are not formalised in ways that can be implemented in information systems. This paper describes a formalised procedure, which is based on the following theoretical propositions: (i) cost behaviour is described on the basis of a company's contracts for purchasing and selling resources, and (ii) hierarchical relationships between decisions are recognised, because some decisions have to be made earlier than others. Earlier decisions determine the feasible alternatives for later decisions (e.g. through constraints in available production capacity or components), and the plans that supported the earlier decisions serve as instructions for later decisions. The procedure can be implemented in information systems to provide accounting information in case later decisions deviate from these instruc tions (within the limits of the real-world constraints) because new information becomes available.     

Economic Production Lot Sizing with Periodic Costs and Overtime*

Traditional approaches for modeling economic production lot‐sizing problems assume that a single, fixed equipment setup cost is incurred each time a product is run, regardless of the quantity manufactured. This permits multiple days of production from one production setup. In this paper, we extend the model to consider additional fixed charges, such as cleanup or inspection costs, that are associated with each time period's production. This manufacturing cost structure is common in the food, chemical, and pharmaceutical industries, where process equipment must be sanitized between item changeovers and at the end of each day's production. We propose two mathematical problem formulations and optimization algorithms. The models' unique features include regular time production constraints, a fixed charge for each time period's production, and the availability of overtime production capacity. Experimental results indicate the conditions under which our algorithms' performance is superior to traditional approaches. We also test the procedures on a set of lot‐sizing problems facing a national food processor and document their potential economic benefit.     

Annualized hours as a capacity planning tool in make-to-order or assemble-to-order environment: An agricultural implements company case

Capacity planning is one of the most important elements for an efficient production planning and control system. It is even more important when the main strategies to fulfil sales requirements are make-to-order (MTO) or assemble-to-order (ATO). Neither MTO or ATO companies keep finished products in stock which means that production level is driven by actual sales figures. Therefore, it is very important to have an available capacity as flexible as possible to meet sales requirements. Annualized hours (AH) is a work time control system that helps in increasing the flexibility of available capacity. The main rule of the AH system is to hire employees to work a certain number of hours on a yearly basis. Following some other pre-defined rules and limits, the AH system allows a company to adjust weekly available time in order to reduce idle capacity or to fulfil requirements that could mean overtime. This paper proposes a linear programming model to plan the operations using AH. This model has been implemented in a company that produces agricultural implements, showing that it is very simple to use. It is producing excellent practical results.     

AN ANALYSIS OF CAPACITY PLANNING PROCEDURES FOR A MATERIAL REQUIREMENTS PLANNING SYSTEM*

This paper is concerned with planning work-center capacity levels in manufacturing firms that employ a material requirements planning (MRP) system. It presents four procedures for developing work-center capacity plans designed to insure the production of components and assemblies as specified by the MRP plan and the master production schedule (MPS). These procedures (capacity planning using overall factors, capacity bills, resource profiles, and capacity requirements planning) are compared using simulation analysis. The results indicate that the performance of a procedure when measured against the MPS depends on the operating conditions of the manufacturing system. The results also indicate that the choice of a particular procedure often represents a compromise among the benefits of improved MPS performance, the costs of preparing and processing data, and the premium expenses required for more frequent adjustments in work-center capacity levels.     

Inner and outer approximations of technology: A shadow profit approach

In this paper we extend the taxonomy on inner and outer approximations to a technology by assuming that price data are not available. Mimicking Varian [Varian H., Econometrica 1984;52(3):579], we introduce a Weak Axiom of Shadow Profit Maximization (WASPM) to test if observed production plans are compatible with technically efficient behavior. If the test fails for an observed sample, we then characterize the maximal subset of observed production plans that meets WASPM and we derive lower and upper bounds on technical efficiency for production plans that are observed but not in this subset. We also derive linear programs to implement these bounds.     

Setups and effective capacity: the impact of lot sizing techniques in an MRP environment

This study investigates how lot sizing techniques influence the profit performance, inventory level, and order lardiness of an assembly job shop controlled by MRP. Four single-level lot sizing techniques are compared by simulation analysis under two levels of master schedule instability and two levels of end item demand. A second analysis investigates the influence of a multilevel lot sizing technique, the generalized constrained-K (GCK) cost modification, on the four single-level techniques at low demand and low nervousness. The analyses reveal a previously unreported phenomenon. Given the same inventory costs, the single-level lot sizing techniques generate substantially different average batch sizes. The lot sizing techniques maintain the following order of increasing average batch size (and decreasing total setup time):

economic order quantity (EOQ)

period order quantity (POQ)

least total cost (LTC)

Silver-Meal heuristic (SML)

The causes for different average batch sizes among the lot sizing techniques are analysed and explained. Demand lumpiness, inherent in multilevel manufacturing systems controlled by MRP, is found to be a major factor. The number of setups each lot sizing technique generates is the primary determinant of profit performance, inventory level, and order tardiness. EOQ, a fixed order quantity technique, is less sensitive to nervousness than the discrete lot sizing techniques. EOQ_, however, generates the smallest average batch size, and, therefore, the most setups. Since setups consume capacity, EOQ, is more sensitive to higher demand. SML generates the largest average batch sizes, and is, therefore, less sensitive to increased demand. At low demand, the other lot sizing techniques perform better on all criteria. They generate smaller batches and, therefore, shorter actual lead times. The GCK cost modification increases the average batch size generated by each lot sizing technique. GCK improves the profit and customer service level of EOQ the lot sizing technique with the smallest batches. GCK causes the other lot sizing techniques to generate excessively large batches and, therefore, excessively long actual lead times.     

Discrete time-varying demand lot-sizing models with learning and forgetting effects

This paper deals with the problem of incorporating both learning and forgetting effects into discrete timevarying demand lot-sizing models to determine lot sizes. Forgetting is retrogression in learning which causes a loss of labour productivity due to breaks between intermittent production runs. Formulae are derived for calculating the production cost required to produce the first unit of each successive lot over a finite planning horizon. An optimal lotsizing model and three heuristic models are developed by extending the existing models without learning and forgetting considerations. Numerical examples and computational experience indicate that larger lot sizes are needed when the phenomenon of learning and forgetting exists. Several important conclusions are drawn from a comparison of the three heuristic solutions with the optimal solution, and suggestions for future research and for lot-size users to choose an appropriate lot-sizing technique are made.     

Solving the Economic Lot-Scheduling Problem Using the Method of Prime Subperiods

In recent years the reported successes of Japanese production systems, particularly the just-in-time approach to inventory control, has caused managers to focus more of their attention on efficient decision-making procedures for determining production schedules that minimize inventory costs. One such potential area of attention is the economic lot-scheduling problem (ELSP), which occurs in a variety of manufacturing environments where machining operations are prevalent. The economic lot-scheduling problem addresses the determination of lot sizes for N products with constant demand (and cycled through one machine with a given production rate) to minimize setup and inventory costs. The most successful solution approaches to the ELSP have been based on the concept of a basic period that is of sufficient length for the production of all items, even though each item might not be produced during each repetition of the basic period. This paper proposes a heuristic approach to the solution of the ELSP (referred to as the method of prime subperiods), which is an extension of the basic period approaches. The procedure is described and demonstrated via an example and then tested using a set of six example problems previously employed in the literature related to the ELSP. The results indicate as good or superior performance by the proposed method of prime subperiods.     

Mitigating overtime risk in tactical surgical scheduling

Overtime is a common phenomenon in surgery departments, causing stress to physicians, dissatisfaction to patients, and financial loss to hospitals. We help risk-averse managers of operating rooms (ORs) to mitigate overtime in tactical surgery scheduling, which determines the assignment of elective patients to available ORs in upcoming time periods. We model the uncertain surgical durations via partial, full, or empirical distributions. To mitigate overtime, our model maximizes the risk aversion level of the OR manager (and thus the risk-hedging ability of the solution) while ensuring that the certainty equivalent of surgery duration in each OR at each time period does not exceed the stipulated working hours. The corresponding decision criterion, termed the maximized risk aversion level, is demonstrated in theory and in numerical experiments to be able to mitigate both the overtime probability and the expected overtime duration. To solve the problem, we develop an exact hill-climbing algorithm and demonstrate its convergence and correctness. Numerical experiments based on real-life surgery data show that our method outperforms the existing methods in several indicators that of concern to OR managers. In particular, this method is computationally amiable and hence is applicable to larger-scale instances.     

A Model for Resource Constrained Production and Inventory Management

We present a general model for multi-item production and inventory management problems that include a resource restriction. The decision variables in the model can take on a variety of interpretations, but will typically represent cycle times, production batch sizes, number of production runs, or order quantities for each item. We consider environments where item demand rates are approximately constant and performing an activity such as producing a batch of a product or placing an order results in the consumption of a scarceresource that is shared among the items. Some examples of shared resources include limited machine capacity, a restriction on the amount of money that can be tied up in stock, orlimited storage capacity. We focus on the case where the decision variables must be integer valued or selected from a discrete set of choices, such as when an integer number of production runs is desired for each item, or in order quantity problems where the items come in pack sizes containing more than one unit and, therefore, the order quantities must be an integer multiple of the pack sizes. We develop a heuristic and a branch and bound algorithm for solving the problem. The branch and bound algorithm includes reoptimization procedures and the heuristic to improve its performance. Computational testing indicates that the algorithms are effective for solving the general model.     

Sleep disturbances in shift-workers: A marker for maladaptation syndrome

Abstract

This study aims to examine whether the relationship between overtime and well-being is influenced by the voluntary vs. involuntary (i.e., compulsory) nature of overtime work and by the presence or absence of rewards for overtime. We also explored the prevalence of these types of overtime and how they were related to work and personal characteristics. A survey was conducted among a representative sample of Dutch full-time employees (N=1612). AN(C)OVA was used to compare rewarded and unrewarded, voluntary and involuntary overtime workers on personal and work characteristics, fatigue, and work satisfaction. Most overtime workers were rewarded (62%). About half of the sample (n=814) could be classified as either voluntary or involuntary overtime workers, or as having “mixed reasons” to work overtime. Voluntary and unrewarded overtime workers had a relatively high income and favourable job characteristics. Involuntary overtime work was associated with relatively high fatigue and low satisfaction, especially for involuntary overtime workers without rewards who can be considered a burnout risk group. Voluntary overtime workers were non-fatigued and satisfied, even without rewards. It can be concluded that control over overtime and rewards for overtime are important for well-being. Moderate overtime work may not be a problem if it is done voluntarily. Moreover, the negative effects of compulsory overtime work may be partly offset by fair compensation for the extra work.     

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.     

MULTI-MACHINE,MULTI-PRODUCT PRODUCTION SCHEDULING AND INVENTORY CONTROL

This paper deals with a multi-machine, multi-product lot size determination and scheduling problem. The model developed here considers not only the usual inventory-related operational cost, but also the costs that depend on under- or over-utilization of available men and machines. It penalizes overtime or idle time at any facility. The solution minimizes the inventory and resource-related costs and not just inventory costs. A heuristic is developed to determine the solution from the model and to modify it, as necessary, to obtain a conflict-free, repetitive, and cyclic production schedule for an infinite horizon. Although this model is developed for a manufacturing situation, the words machine, job, and machine shop are used in a symbolic sense, and hence the model can be used in practice in a variety of circumstances.