Controlling job arrivals with processing time windows into Batch Processor Buffer

We consider a two-stage manufacturing system composed of a batch processor and its upstream processor. Jobs exit the upstream processor and join a queue in front of the batch processor, where they wait to be processed. The batch processor has a finite capacity Q, and its processing time is independent of the number of jobs loaded into the batch processor. In certain manufacturing systems (including semiconductor wafer fabrication), a processing time window exists from the time instance the job exits the upstream processor till the time instance it enters the batch processor. If a job is not processed before reaching the end of its processing time window, job rework or validation is required. We model this drawback by assigning a reward R for each successfully processed job by the upstream processor, and a penalty C for each job that reaches the end of its processing time window without being processed by the batch processor. We initially assume an infinite job source in front of the serial processor and also assume that the batch processor is operated under a threshold policy. We provide a method for controlling the production of the serial processor, considering the processing time window between the upstream processor and the downstream batch processor. We then show how the serial processor control policy can be modified when the serial processor also experiences intermittent job arrival.     

An economic order quantity with imperfect quality and quantity discounts

Previous studies in the issue of inventory models with imperfect quality assumed the defectives could be sold in a batch by the end of the inspection process and the manufacturing systems were push systems. However, the above assumptions may not be true in the pull system in which buyer is powerful. Therefore, in this paper, we develop a new inventory model for items with imperfect quality and quantity discounts where buyer has exerted power over its supplier. Based on the concept of powerful buyer, there are three considerations included in this new model: (1) the order quantity is manufactured at one setup and is shipped over multiple deliveries, (2) the defectives are screened out by a 100% inspection for each shipment but sold in a batch by the end of inspection at the last shipment of each cycle, and (3) the supplier offers quantity discounts to response the request of the powerful buyer. Further, an algorithm is developed to help the powerful buyer to determine the optimal order policy accurately and quickly. Two numerical examples are available in this paper to illustrate the proposed model and algorithm. Besides, based on the numerical examples, a sensitivity analysis is made to investigate the effects of four important parameters (the inspection rate, the defective rate, the receiving cost, and the ordering cost) on the optimal solution.     

Pricing and lot sizing for an EPQ inventory model with rework and multiple shipments

This paper deals with an economic production quantity (EPQ) inventory model with reworkable defective items when a given multi-shipment policy is used. In this work, it is assumed that in each cycle, the rework process of all defective items starts when the regular production process finishes. After the rework process, a portion of reworked items fails. This portion becomes scrap and only the perfect finished items can be delivered to customers at the end of rework process. A profit function is derived to model the inventory problem and it is shown that the profit function is concave. Due to the complexity of the optimization problem, an algorithm is developed to determine the optimal values of manufacturing lot size and price such that the long-run average profit function is maximized. Furthermore, two special cases are identified and explained. Finally, a numerical example is given to illustrate the applicability of the proposed inventory model.     

An Optimal Batch Size for a Production System Operating Under a Fixed-Quantity,Periodic Delivery Policy

A manufacturing system which procures raw materials from suppliers and processes them to convert to finished products is considered here. This paper develops an ordering policy for raw materials to meet the requirements of a production facility which, in turn, must deliver finished products demanded by outside buyers at fixed interval points in time. First, a general cost model is developed considering both supplier (of raw material) and buyer (of finished products) sides. This model is used to determine an optimal ordering policy for procurement of raw materials, and the manufacturing batch size to minimize the total cost for meeting equal shipments of the finished products, at fixed intervals, to the buyers. The total cost is found to be a piece-wise convex cost function. An interval that contains the optimal solution is first determined followed by an optimization technique to identify the exact solution from this interval.     

Operations planning for a multi-stage kanban system

A multi-stage production line which operates under a just-in-time production philosophy with linear demand is considered here. The first workstation processes the raw materials after receiving them from suppliers, a kanban mechanism between the workstations transports the work-in-process to the succeeding workstation, and after processing them, delivers the finished products to a buyer or a warehouse. The problem is to find optimally the number of raw material orders, kanbans circulated between workstations, finished goods shipments to the buyers, and the batch size for each shipment (lot). A cost function is developed based on the costs incurred due to the raw materials, the work-in-process between workstations, and the finished goods. Optimal number of raw material orders that minimizes the total cost is obtained, which is then used to find the optimal number of kanbans, finished goods shipments, and the batch sizes for shipments. Numerical examples are used to demonstrate the computations of optimal parameters, and to configure the kanban mechanism on a timescale. Several avenues for future research are also indicated.     

Optimal replenishment policy for imperfect quality EMQ model with rework and backlogging

This paper derives the optimal replenishment policy for imperfect quality economic manufacturing quantity (EMQ) model with rework and backlogging. The classic EMQ model assumes that all items produced are of perfect quality. However, in real‐life manufacturing settings, generation of imperfect quality items is almost inevitable. In this study, a random defective rate is assumed. All items produced are inspected and the defective items are classified as scrap and repairable. A rework process is involved in each production run when regular manufacturing process ends, and a rate of failure in repair is also assumed. Unit disposal cost and unit repairing and holding costs are included in our mathematical modelling and analysis. The renewal reward theorem is employed in this study to cope with the variable cycle length. The optimal replenishment policy in terms of lot‐size and backlogging level that minimizes expected overall costs for the proposed imperfect quality EMQ model is derived. Special cases of the model are identified and discussed. Numerical example is provided to demonstrate its practical usage. Copyright © 2006 John Wiley & Sons, Ltd.     

On optimal batch sizing in a multi-stage production system with rework consideration

Recently, Sarker et al. [Sarker, B.R., Jamal, A.M.M., Mondal, S., 2008. Optimal batch sizing in a multi-stage production system with rework consideration. European Journal of Operational Research 184(3) 915–929] presented an EPQ inventory model for a multi-stage manufacturing system with rework process; basically they proposed two operational inventory policies. In the paper, there are some mathematical expressions which are to be corrected. At first, this paper presents the mathematical expressions corrected and the appropriate solution to the numerical example. We also established the closed forms for the optimal total inventory cost, the conditions for which there is an optimal solution, and the mathematical expressions for determining the total additional cost for working with a non optimal solution for both policies that were not given by Sarker et al. (2008).     

Lead time and response time in a pull production control system

In the late 80s, most manufacturers have shifted their manufacturing strategies from cost and quality to speed. This paper focuses on two performance measures of speed: manufacturing lead time and response time. Manufacturing lead time is the sum of the processing time to convert raw material to finished goods and the waiting time at the buffers. Response time is the time between the customer places an order and the customer receives the order. In this paper we develop a queueing model of a pull-based production control system for a single-stage facility. The intent of the model is two-fold. First, we highlight the trade-off between manufacturing lead time and response time. Second, we develop an optimization model to determine an optimal control system that guarantees certain delivery performance (in terms of response time).     

Supply chain models for an assembly system with preprocessing of raw materials

In this paper, we investigate the material procurement and delivery policy in a production system where raw materials enter into the assembly line from two different flow channels. The system encompasses batch production process in which the finished product demand is approximately constant for an infinite planning horizon. Two distinct types of raw materials are passed through the assembly line before to convert them into the finished product. Of the two types of raw materials, one type requires preprocessing inside the facility before the assembly operation and other group is fed straightway in the assembly line. The conversion factors are assigned to raw materials to quantify the raw material batch size required. To analyze such a system, we formulate a nonlinear cost function to aggregate all the costs of the inventories, ordering, shipping and deliveries. An algorithm using the branch and bound concept is provided to find the best integer values of the optimal solutions. The result shows that the optimal procurement and delivery policy minimizes the expected total cost of the model. Using a test problem, the inventory requirements at each stage of production and their corresponding costs are calculated. From the analysis, it is shown that the rate and direction change of total cost is turned to positive when delivery rates per batch reaches close to the optimal value and the minimum cost is achieved at the optimal delivery rate. Also, it is shown that total incremental cost is monotonically increasing, if the finished product batch size is increased, and if, inventory cost rates are increased. We examine a set of numerical examples that reveal the insights into the procurement-delivery policy and the performance of such an assembly type inventory model.     

Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers

This research addresses an optimal policy for production and procurement in a supply-chain system with multiple non-competing suppliers, a manufacturer and multiple non-identical buyers. The manufacturer procures raw materials from suppliers, converts them to finished products and ships the products to each buyer at a fixed-interval of time over a finite planning horizon. The demand of finished product is given by buyers and the shipment size to each buyer is fixed. The problem is to determine the production start time, the initial and ending inventory, the cycle beginning and ending time, the number of orders of raw materials in each cycle, and the number of cycles for a finite planning horizon so as to minimize the system cost. A surrogate network representation of the problem developed to obtain an efficient, optimal solution to determine the production cycle and cycle costs with predetermined shipment schedules in the planning horizon. This research prescribes optimal policies for a multi-stage production and procurements for all shipments scheduled over the planning horizon. Numerical examples are also provided to illustrate the system.     

Batch scheduling of deteriorating reworkables

The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. Each batch comprises two sub-batches processed consecutively. In the first sub-batch, all the items are newly manufactured. Some of them are of the required good quality and some are defective. The defective items are remanufactured in the second sub-batch. They deteriorate while waiting for rework. This results in increased time and cost for their remanufacturing. All the items in the same sub-batch complete at the same time, which is the completion time of the last item in the sub-batch. Each remanufactured defective item is of the required good quality. It is assumed that the percentage of defective items in each batch is the same. A setup time is required to start batch processing and to switch from manufacturing to remanufacturing. The demands for good quality items over time are given. The objective is to find batch sizes such that the total setup and inventory holding cost is minimized and all the demands are satisfied. Dynamic programming algorithms are presented for the general problem and some important special cases.     

Complexity in rework cells: theory,analysis and comparison

Although the word complexity is often used by engineers who are trying to re-design or re-organize a system, a formal definition of the term is often lacking. This paper introduces and extends the application of the concept of entropy to the quantitative analysis of complexity in the design and study of manufacturing systems. Sequence disorder complexity and routing complexity are defined in the context of manufacturing systems specifically including rework cells. Different kinds of rework cells are defined and their parameters presented. The difference between input and output sequences is studied with respect to rework cell system parameters and we introduce a quantitative complexity metric to measure the difference between alternative rework cells. The emphasis of this paper is on providing a comprehensive comparison on system performance of several structures of rework cells in terms of complexity, cost and quality. The paper concludes that both the choice of rework cells structure and system parameter selection are important to the design of rework cells.     

A model of JIT make-to-stock inventory with stochastic demand

We consider a firm that manages its internal manufacturing operations according to a just-in-time (JIT) system but maintains an inventory of finished goods as a buffer against random demands from external customers. We formulate a model in which finished goods are replenished by a small fixed quantity each time period. In the interest of schedule stability, the size of the replenishment quantity must remain fixed for a predetermined interval of time periods. We analyse the single-interval problem in depth, showing how to compute a cost-minimising value of the replenishment quantity for a given interval length, and characterising the optimal cost, inventory levels and service as functions of the interval length and initial inventory. The model displays significant cost and service penalties for schedule stability. A dynamic version of the problem is also formulated, and shown to be convex in nature with relatively easily computed optima.     

Integrated Production Inventory Policies for Multistage Multiproduct Batch Production Systems

An integrated production inventory model is considered in this paper, for a flow shop type multiproduct batch production system, with a multifacility structure. Instantaneous production is allowed in each facility. The model aims to determine simultaneously the optimal manufacturing cycle for the multiple products and the corresponding optimal procurement policies for the raw material. The cycle concept of multiproduct batch processing is extended to multifacility system and is integrated with the concept of production-inventory system for a single product, single facility system.     

Determining the optimal run time for EPQ model with scrap,rework, and stochastic breakdowns

This paper is concerned with determination of optimal run time for an economic production quantity (EPQ) model with scrap, rework, and stochastic machine breakdowns. In real life manufacturing systems, generation of defective items and random breakdown of production equipment are inevitable. In this study, a portion of the defective items is considered to be scrap, while the other is assumed to be repairable. Total production-inventory cost functions are derived respectively for both EPQ models with breakdown (no-resumption policy is adopted) and without breakdown taking place. These cost functions are integrated and the renewal reward theorem is used to cope with the variable cycle length. Theorems on conditional convexity of the integrated overall costs and bounds of the production run time are proposed and proved. We conclude that the optimal run time falls within the range of bounds and it can be pinpointed by the use of the bisection method based on the intermediate value theorem. Numerical example is provided to demonstrate its practical usages.     

Remarks on the optimization process of a manufacturing system with stochastic breakdown and rework

This paper reexamines the optimization process of a manufacturing system with stochastic breakdown and rework proposed by Chiu [S.W. Chiu, An optimization problem of manufacturing systems with stochastic machine breakdown and rework process, Applied Stochastic Models in Business and Industry 24 (2008) 203–219]. The proof of convexity of the long-run average cost function for the aforementioned manufacturing system is provided in this note. It can be used to replace the conditional convexity given in Theorem 1 of Chiu (2008) [1]. Therefore, when determining the optimal solution for such a real-life system, computational efforts in verifying the conditional convexity can now be omitted, due to the improved quality of the optimization process.     

多阶段生产系统最优生产批量和原材料订购决策模型

Sarker和Parija(1996)建立了生产系统最优生产批量和原材料订购决策模型。然而他们的模型仅局限于单阶段生产系统,本文将他们的模型扩展到多阶段生产系统,我们首先建立了使整个多阶段生产系统总成本最小的各阶段最优生产批量、原材料订购批量及阶段之间的运输批量模型,然后分析了原材料订购费、半成品运费及设备安装费的敏感性。最后,我们结合实例综合分析了原材料订购费、半成品运输费和设备安装费的变化及最小值点取整后对原材料订购决策、最优生产批量和总成本的影响。     

Setup cost reduction in (<Emphasis Type="Italic">Q,r</Emphasis>) policy with lot size,setup time and lead-time interactions

It is often assumed in most deterministic and stochastic inventory models that lead-time is a given parameter and the optimal operating policy is determined on the basis of this unrealistic assumption. However, the manufacturing lead-time is made up of several components (moving time, waiting time, setup time, lot size, and rework time) most of which should be treated as controllable variables. In this paper the effect of setup cost reduction is addressed in a stochastic continuous review inventory system with lead-time depending on lot size and setup time. An efficient iterative procedure is developed to determine the near optimal lot size, reorder point and setup time. Furthermore, a sensitivity analysis is carried out to assess the cost savings that can be realised by investing in setup.     

Cost-effective inventory control in a value-added manufacturing system

This paper considers the cost-effective inventory control of work-in-process (WIP) and finished products in a two-stage distributed manufacturing system. The first stage produces a common WIP, and the second stage consists of several production sites that produce differentiated products with different capacity and service level requirements. The unit inventory holding cost is higher at the second stage. This paper first uses a network of inventory-queue model to evaluate the inventory cost and service level achievable for given inventory control policy, and then derives a very simple algorithm to find the optimal inventory control policy that minimizes the overall inventory holding cost and satisfies the given service level requirements. Some managerial insights are obtained through numerical examples.     

Cyclic Scheduling for a Multi-product,Single-facility Production System Operating Under a Just-in-time Delivery Policy

Sarker and Parija have developed a model for obtaining the optimal batch size for a single-product manufacturing system operating under a fixed-quantity, periodic delivery policy. In this work, the model is extended to a multi-product situation and a single-facility scheduling scheme is developed for the system. Two situations are considered—one with fixed setup cost and the other with variable setup cost. It is observed that setup cost variability is beneficial to the system under certain conditions.