Optimal Production and Admission Policies in Make‐to‐Stock/Make‐to‐Order Manufacturing Systems

In this article, we study optimal production and admission control policies in manufacturing systems that produce two types of products: one type consists of identical items that are produced to stock, while the other has varying features and is produced to order. The model is motivated by applications from various industries, in particular, the automobile industry, where a part supplier receives orders from both an original equipment manufacturer and the aftermarket. The product for the original equipment manufacturer is produced to stock, it has higher priority, and its demands are fully accepted. The aftermarket product is produced to order, and its demands can be either accepted or rejected. We characterize the optimal production and admission policies with a partial‐linear structure, and using computational analysis, we provide insights into the benefits of the new policies. We also investigate the impact of production capacity, cost structure, and demand structure on system performance.     

End‐of‐Life Inventory Problem with Phaseout Returns

We consider the service parts end‐of‐life inventory problem of a capital goods manufacturer in the final phase of its life cycle. The final phase starts as soon as the production of parts terminates and continues until the last service contract expires. Final order quantities are considered a popular tactic to sustain service fulfillment obligations and to mitigate the effect of obsolescence. In addition to the final order quantity, other sources to obtain serviceable parts are repairing returned defective items and retrieving parts from phaseout returns. Phaseout returns happen when a customer replaces an old system platform with a next‐generation one and returns the old product to the original equipment manufacturer (OEM). These returns can well serve the demand for service parts of other customers still using the old generation of the product. In this study, we study the decision‐making complications as well as cost‐saving opportunities stemming from phaseout occurrence. We use a finite‐horizon Markov decision process to characterize the structure of the optimal inventory control policy. We show that the optimal policy consists of a time‐varying threshold level for item repair. Furthermore, we study the value of phaseout information by extending the results to cases with an uncertain phaseout quantity or an uncertain schedule. Numerical analysis sheds light on the advantages of the optimal policy compared to some heuristic policies.     

RADIOISOTOPE PRODUCTION SCHEDULING IN A NUCLEAR REACTOR

A multiperiod mixed integer programming model has been developed for the production scheduling of several grades of a radioisotope in a nuclear reactor. Of special interest is the model's capability to evaluate possible future product “short falls” due to the acceptance of an unforecasted demand sales opportunity. The model is essential to decisions concerning reactor loading after an extended shutdown of several periods for modifications, maintenance, and upgrading.     

TWO‐ AND THREE‐STAGE FLOWSHOP SCHEDULING WITH NO‐WAIT IN PROCESS

In this paper we study the time complexities of some two‐ and three‐stage no‐wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP‐complete.     

Optimal Choice for Appointment Scheduling Window under Patient No‐Show Behavior

Observing that patients with longer appointment delays tend to have higher no‐show rates, many providers place a limit on how far into the future that an appointment can be scheduled. This article studies how the choice of appointment scheduling window affects a provider's operational efficiency. We use a single server queue to model the registered appointments in a provider's work schedule, and the capacity of the queue serves as a proxy of the size of the appointment window. The provider chooses a common appointment window for all patients to maximize her long‐run average net reward, which depends on the rewards collected from patients served and the “penalty” paid for those who cannot be scheduled. Using a stylized M/M/1/K queueing model, we provide an analytical characterization for the optimal appointment queue capacity K, and study how it should be adjusted in response to changes in other model parameters. In particular, we find that simply increasing appointment window could be counterproductive when patients become more likely to show up. Patient sensitivity to incremental delays, rather than the magnitudes of no‐show probabilities, plays a more important role in determining the optimal appointment window. Via extensive numerical experiments, we confirm that our analytical results obtained under the M/M/1/K model continue to hold in more realistic settings. Our numerical study also reveals substantial efficiency gains resulted from adopting an optimal appointment scheduling window when the provider has no other operational levers available to deal with patient no‐shows. However, when the provider can adjust panel size and overbooking level, limiting the appointment window serves more as a substitute strategy, rather than a complement.     

Replenishment Policies for Multi‐Product Stochastic Inventory Systems with Correlated Demand and Joint‐Replenishment Costs

This study analyzes optimal replenishment policies that minimize expected discounted cost of multi‐product stochastic inventory systems. The distinguishing feature of the multi‐product inventory system that we analyze is the existence of correlated demand and joint‐replenishment costs across multiple products. Our objective is to understand the structure of the optimal policy and use this structure to construct a heuristic method that can solve problems set in real‐world sizes/dimensions. Using an MDP formulation we first compute the optimal policy. The optimal policy can only be computed for problems with a small number of product types due to the curse of dimensionality. Hence, using the insight gained from the optimal policy, we propose a class of policies that captures the impact of demand correlation on the structure of the optimal policy. We call this class (s, c, d, S)‐policies, and also develop an algorithm to compute good policies in this class, for large multi‐product problems. Finally using an exhaustive set of computational examples we show that policies in this class very closely approximate the optimal policy and can outperform policies analyzed in prior literature which assume independent demand. We have also included examples that illustrate performance under the average cost objective.     

Workforce‐constrained Preventive Maintenance Scheduling Using Evolution Strategies

Heavy equipment overhaul facilities such as aircraft service centers and railroad yards face the challenge of minimizing the makespan for a set of preventive maintenance (PM) tasks, requiring single or multiple skills, within workforce availability constraints. In this paper, we examine the utility of evolution strategies to this problem. Comparison of the computational efforts of evolution strategies with exhaustive enumeration to reach optimal solutions for 60 small problems illustrates the ability of evolution strategies to yield optimal solutions increasingly efficiently with increasing problem size. A set of 852 large‐scale problems was solved using evolution strategies to examine the effects of task‐related problem characteristics, workforce‐related variables, and evolution strategies population size (μ) on CPU time. The results empirically supported practical utility of evolution strategies to solve large‐scale, complex preventive maintenance problems involving single‐ and multiple‐skilled workforce. Finally, comparison of evolution strategies and simulated annealing for the 852 experiments indicated much faster convergence to optimality with evolution strategies.     

A Comparison between Basic Cyclic Scheduling and Variable Cyclic Scheduling in a Two‐stage Hybrid Flow Shop

In this paper the impacts of two types of repetitive scheduling systems on the makespan in a two‐stage hybrid flow shop, which consists of one machine in the first stage and multiple process lines in the second stage, are compared. First, we analyzed, through a simulation, how the makespan is affected by the setup frequency and sequencing rules for products under two types of scheduling systems: One is repetitive scheduling with only one batch per product family per scheduling cycle (basic cyclic scheduling system). The other is repetitive cyclic scheduling with various batches per product family per scheduling cycle (variable cyclic scheduling system). Second, we compared which scheduling system is superior under various manufacturing situations. The following points were noted. (1) The superior scheduling system can be shown by a two‐dimensional diagram of the setup frequency and the imbalance in workload for processing among process lines in the second stage. (2) Variable cyclic scheduling is superior in comparison with basic cyclic scheduling when there is a large imbalance in the workload to be processed among process lines in the second stage, or the workload in the second stage is larger than that in the first stage. The result of this research provides guidelines for selecting which scheduling system should be adopted.     

An Advanced Heuristic for Multiple‐Option Spare Parts Procurement after End‐of‐Production

After‐sales service is a major source of profit for many original equipment manufacturers in industries with durable products. Successful engagement in after‐sales service improves customer loyalty and allows for competitive differentiation through superior service like an extended service period during which customers are guaranteed to be provided with service parts. Inventory management during this period is challenging due to the substantial uncertainty concerning demand over a long time horizon. The traditional mechanism of spare parts acquisition is to place a large final order at the end of regular production of the parent product, causing major holding costs and a high level of obsolescence risk. With an increasing length of the service period, more flexibility is needed and can be provided by adding options like extra production and remanufacturing. However, coordinating all three options yields a complicated stochastic dynamic decision problem. For that problem type, we show that a quite simple decision rule with order‐up‐to levels for extra production and remanufacturing is very effective. We propose a heuristic procedure for parameter determination which accounts for the main stochastic and dynamic interactions in decision making, but still consists of relatively simple calculations that can be applied to practical problem sizes. A numerical study reveals that the heuristic performs extremely well under a wide range of conditions, and therefore can be strongly recommended as a decision support tool for the multi‐option spare parts procurement problem. A comparison with decision rules adapted from practice demonstrates that our approach offers an opportunity for major cost reductions.     

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.     

Investment in Facility Changeover Flexibility for Early Entry into High‐Tech Markets

A model is introduced to analyze the manufacturing‐marketing interface for a firm in a high‐tech industry that produces a series of high‐volume products with short product life cycles on a single facility. The one‐time strategic decision regarding the firm's investment in changeover flexibility establishes the link between market opportunities and manufacturing capabilities. Specifically, the optimal changeover flexibility decision is determined in the context of the firm's market entry strategy for successive product generations, the changeover cost between generations, and the production efficiency of the facility. Moreover, the dynamic pricing policy for each product generation is obtained as a function of the firm's market entry strategy and manufacturing efficiency. Our findings provide insights linking internal manufacturing capabilities with external market forces for the high‐tech and high‐volume manufacturer of products with short life cycles. We show the impact of manufacturing efficiency and a firm's ability to benefit from volume‐based learning on the dynamic pricing policy for each product generation. The results demonstrate the benefits realized by a firm that works with its manufacturing equipment suppliers to develop more efficient and flexible technology. In addition, we explore how opportunities afforded by pioneer advantage enable a firm operating a less efficient facility to realize long term competitive advantage by deploying an earlier market entry strategy.     

Practical Implications of Preference‐Based Conference Scheduling

Conference scheduling involves organizing presentations into sessions which are assigned to time periods and rooms. This includes assuring a feasible utilization of time periods and rooms, and avoiding individual schedule conflicts. The problem increases in complexity by considering the preferences of presenters: for time periods, for rooms, etc. A greater level of complexity comes from considering the preferences of conference attendees, which we define as preference‐based conference scheduling (PBCS). This article provides a structure on which PBCS problems are founded, including empirical demonstration of solution techniques. In addition, real‐world strategic planning issues of flexibility and preference detail are explored.     

An Analysis of Dual‐Kanban Just‐In‐Time Systems in a Non‐Repetitive Environment

Recent advances in approaches and production technologies for the production of goods and services have made just‐in‐time (JIT) a strong alternative for use in intermittent and small batch production systems, especially when time‐based competition is the norm and a low inventory is a must. However, the conventional JIT system is designed for mass production with a stable master production schedule. This paper suggests supplementing the information provided by production kanbans with information about customer waiting lines to be used by operators to schedule production in each work‐station of intermittent and small batch production systems. This paper uses simulation to analyze the effect of four scheduling policy variables—number of kanbans, length of the withdrawal cycle, information about customer waiting lines, and priority rules on two performance measures—customer wait‐time and inventory. The results show that using information about customer waiting lines reduces customer wait‐time by about 30% while also reducing inventory by about 2%. In addition, the effect of information about customer waiting lines overshadows the effect of priority rules on customer wait‐time and inventory.     

Pool‐Point Distribution of Zero‐Inventory Products

We study zero‐inventory production‐distribution systems under pool‐point delivery. The zero‐inventory production and distribution paradigm is supported in a variety of industries in which a product cannot be inventoried because of its short shelf life. The advantages of pool‐point (or hub‐and‐spoke) distribution, explored extensively in the literature, include the efficient use of transportation resources and effective day‐to‐day management of operations. The setting of our analysis is as follows: A production facility (plant) with a finite production rate distributes its single product, which cannot be inventoried, to several pool points. Each pool point may require multiple truckloads to satisfy its customers' demand. A third‐party logistics provider then transports the product to individual customers surrounding each pool point. The production rate can be increased up to a certain limit by incurring additional cost. The delivery of the product is done by identical trucks, each having limited capacity and non‐negligible traveling time between the plant and the pool points. Our objective is to coordinate the production and transportation operations so that the total cost of production and distribution is minimized, while respecting the product lifetime and the delivery capacity constraints. This study attempts to develop intuition into zero‐inventory production‐distribution systems under pool‐point delivery by considering several variants of the above setting. These include multiple trucks, a modifiable production rate, and alternative objectives. Using a combination of theoretical analysis and computational experiments, we gain insights into optimizing the total cost of a production‐delivery plan by understanding the trade‐off between production and transportation.     

Outsourcing to a Powerful Contract Manufacturer: The Effect of Learning‐by‐Doing

The contract manufacturing industry has grown rapidly in recent years as firms have increasingly outsourced production to reduce costs. This growth has created powerful contract manufacturers (CMs) in several industries. Achieving a competitive cost position is often a primary motive for outsourcing. Outsourcing influences both the original equipment manufacturer's (OEM) and the CM's production levels, and, therefore, through learning‐by‐doing renders future costs dependent on past outsourcing decisions. As such, outsourcing should not be viewed as a static decision that, once made, is not revisited. We address these considerations by analyzing a two‐period game between an OEM and a powerful CM wherein both firms can reduce their production costs through learning‐by‐doing. We find that partial outsourcing, wherein the OEM simultaneously outsources and produces in‐house, can be an optimal strategy. Also, we find that the OEM's outsourcing strategy may be dynamic—i.e., change from period to period. In addition, we find both that the OEM may engage in production for leverage (i.e., produce internally when at a cost disadvantage) and that the CM may engage in low balling. These and other findings in this paper demonstrate the importance of considering learning, the power of the CM, and future periods when making outsourcing decisions.     

A MARKET UTILITY‐BASED MODEL FOR CAPACITY SCHEDULING IN MASS SERVICES

Only a small set of employee scheduling articles have considered an objective of profit or contribution maximization, as opposed to the traditional objective of cost (including opportunity costs) minimization. In this article, we present one such formulation that is a market utility‐based model for planning and scheduling in mass services (MUMS). MUMS is a holistic approach to market‐based service capacity scheduling. The MUMS framework provides the structure for modeling the consequences of aligning competitive priorities and service attributes with an element of the firm's service infrastructure. We developed a new linear programming formulation for the shift‐scheduling problem that uses market share information generated by customer preferences for service attributes. The shift‐scheduling formulation within the framework of MUMS provides a business‐level model that predicts the economic impact of the employee schedule. We illustrated the shift‐scheduling model with empirical data, and then compared its results with models using service standard and productivity standard approaches. The result of the empirical analysis provides further justification for the development of the market‐based approach. Last, we discuss implications of this methodology for future research.     

New Product Design under Channel Acceptance: Brick‐and‐Mortar,Online‐Exclusive,or Brick‐and‐Click

In recent years, an increasing number of brick‐and‐mortar retailers have entered into the new brick‐and‐click era. Within this context, when a manufacturer presents a new product offering to a retailer, the ultimate decision is often made by the retailer regarding (1) whether to carry the new product, and (2) the channel outlet the product will be carried in (i.e., in‐store only, online‐exclusive, or brick‐and‐click). In response to this trend, we examine how a manufacturer may use product design to influence a dual‐channel retailer's outlet designation decision. This is the first study to investigate a manufacturer's optimal product design strategy when a brick‐and‐mortar retailer expands online. We demonstrate that, to induce the retailer to carry a new product both offline and online, it may not always be optimal for the manufacturer to enhance product quality (compared with when the retailer only operates offline). With the online store addition, the retailer may also be incentivized to adjust his participation criterion to a level less than what is determined by his outside option.     

Optimal Dynamic Order Scheduling under Capacity Constraints Given Demand‐Forecast Evolution

We consider a manufacturer without any frozen periods in production schedules so that it can dynamically update the schedules as the demand forecast evolves over time until the realization of actual demand. The manufacturer has a fixed production capacity in each production period, which impacts the time to start production as well as the production schedules. We develop a dynamic optimization model to analyze the optimal production schedules under capacity constraint and demand‐forecast updating. To model the evolution of demand forecasts, we use both additive and multiplicative versions of the martingale model of forecast evolution. We first derive expressions for the optimal base stock levels for a single‐product model. We find that manufacturers located near their market bases can realize most of their potential profits (i.e., profit made when the capacity is unlimited) by building a very limited amount of capacity. For moderate demand uncertainty, we also show that it is almost impossible for manufacturers to compensate for the increase in supply–demand mismatches resulting from long delivery lead times by increasing capacity, making lead‐time reduction a better alternative than capacity expansion. We then extend the model to a multi‐product case and derive expressions for the optimal production quantities for each product given a shared capacity constraint. Using a two‐product model, we show that the manufacturer should utilize its capacity more in earlier periods when the demand for both products is more positively correlated.     

DETERMINISTIC TIME‐VARYING DEMAND LOT‐SIZING MODELS WITH LEARNING AND FORGETTING IN SETUPS AND PRODUCTION

We study the deterministic time‐varying demand lot‐sizing problem in which learning and forgetting in setups and production are considered simultaneously. It is an extension of Chiu's work. We propose a near‐optimal forward dynamic programming algorithm and suggest the use of a good heuristic method in a situation in which the computational effort is extremely intolerable. Several important observations obtained from a two‐phase experiment verify the goodness of the proposed algorithm and the chosen heuristic method.     

The Impact of Complementary Agglomeration and Multi‐unit Systems on New Product Introduction

This study explores the relationship between organizational agglomeration and new product introduction. It proposes that product‐complementary agglomeration increases the likelihood of new product introduction, but that the effect on new product introduction is non‐linear. In addition, the influence of agglomeration on new product introduction is contingent on organizational form (i.e. multi‐unit form or independent form). Using longitudinal data for the hospital industry in Taiwan from 1997 to 2002, we found that the relationship between product‐complementary agglomeration and new product introduction is an upward trending hooked curve. As the degree of complementary agglomeration increases, the likelihood of introducing new products also increases, but the rate of increase diminishes with the degree of complementary agglomeration. In addition, we also found that the positive effect of product‐complementary agglomeration on new product introduction is stronger for independent firms than for multi‐unit firms.