A production model for deteriorating items with stochastic preventive maintenance time and rework process with FIFO rule

Due to unreliable production facility and stochastic preventive maintenance, deriving an optimal production inventory decision in practice is very complicated. In this paper, we develop a production model for deteriorating items with stochastic preventive maintenance time and rework using the first in first out (FIFO) rule. From our literature search, no study has been done on the above problem. The problem is solved using a simple search procedure; this makes it more practical for use by industries. Two case examples using uniform and exponential distribution preventive maintenance time are applied. Examples and sensitivity analysis are conducted for each case. The results show that rework and preventive maintenance time have significant affected the total cost and the optimal production time. This provides helpful managerial insights to help management in making smart decisions.     

Joint modified block replacement and production/inventory control policy for a failure-prone manufacturing cell

This paper considers a joint preventive maintenance (PM) and production/inventory control policy of an unreliable single machine, mono-product manufacturing cell with stochastic non-negligible corrective and preventive delays. The production/inventory control policy, which is based on the hedging point policy (HPP), consists in building and maintaining a safety stock of finished products in order to respond to demand and to avoid shortages during maintenance actions. Without considering the impact of preventive and corrective actions on the overall performance of the production system, most authors working in the reliability and maintainability domains confirm that the age-based preventive maintenance policy (ARP) outperforms the classical block-replacement policy (BRP). In order to reduce wastage incurred by the classical BRP, we consider a modified block replacement policy (MBRP), which consists in canceling a preventive maintenance action if the time elapsed since the last maintenance action exceeds a specified time threshold. The main objective of this paper is to determine the joint optimal policy that minimizes the overall cost, which is composed of corrective and preventive maintenance costs as well as inventory holding and backlog costs. A simulation model mimicking the dynamic and stochastic behavior of the manufacturing cell, based on more realistic considerations of the real behavior of industrial manufacturing cells, is proposed. Based on simulation results, the joint optimal MBRP/HPP parameters are obtained through a numerical approach that combines design of experiment, analysis of variance and response surface methodologies. The joint optimal MBRP/HPP policy is compared to classical joint ARP/HPP and BRP/HPP optimal policies, and the results show that the proposed MBRP/HPP outperforms the latter. Sensitivity analyses are also carried out in order to confirm the superiority of the proposed MBRP/HPP, and it is observed that for practitioners, the proposed joint MBRP/HPP offers not only cost savings, but is also easy to manage, as compared to the ARP/HPP policy.     

Production lot sizing with process deterioration and machine breakdown under inspection schedule

The paper develops integrated production, inventory and maintenance models for a deteriorating production system in which the production facility may not only shift from an ‘in-control’ state to an ‘out-of-control’ state but also may break down at any random point in time during a production run. In case of machine breakdown, production of the interrupted lot is aborted and a new production lot is started when the on-hand inventory is depleted after corrective repair. The process is inspected during each production run to examine the state of the production process. If it is found in the ‘in-control’ state then either (a) no action is taken except at the time of last inspection where preventive maintenance is done (inspection policy-I) or (b) preventive maintenance is performed (inspection policy-II). If, however, the process is found to be in the ‘out-of-control’ state at any inspection then restoration is done. The proposed models are formulated under general shift, breakdown and repair time distributions. As it is, in general, difficult to find the optimal production policy under inspection policy-I, a suboptimal production policy is derived. Numerical examples are taken to determine numerically the optimal/suboptimal production policies of the proposed models, to examine the sensitivity of important model parameters and to compare the performance of inspection and no inspection policies.     

Release of maintenance jobs in a decentralized multi-stage production/maintenance system with continuous condition monitoring

Condition-based maintenance is analyzed for multi-stage production with a separate maintenance department. It is assumed that the conditions of the machines deteriorate as a function of multiple production parameters and that the task of maintenance is to keep up predefined operational availabilities of the individual machines. In this context the problem of determining the optimal machine condition that triggers the release of a preventive maintenance job and the problem of scheduling maintenance jobs at the maintenance department arise. Existing approaches to solve these problems either assume a monolithic production/maintenance system or concentrate on a decentralized system in which the information flow and resource transfer do not cause delays. With our paper we aim at (1) deriving a triggering mechanism that is able to cope with relaxed assumptions and at (2) developing specific priority rules for scheduling maintenance jobs. Therefore, in this paper a specific continuous condition monitoring and a suitable information exchange protocol are developed, factors determining the release situation are operationalized, impacts of choosing the triggering conditions are identified and the components of specific priority rules for scheduling maintenance jobs are clearly elaborated. Finally the performance of the resulting solution approach is analyzed by simulations. Thereby, relevant characteristics of the production/maintenance system, the maintenance task and relevant priority rules are varied systematically. This research contributes answers to the questions on how the exchange of local information can be structured, the parameters of condition-based maintenance can be set and on what maintenance-specific priority rules can be applied in case of incomplete information about deterioration in a decentralized multistage production/maintenance system.     

考虑故障停机的生产控制与维修计划联合决策模型

通过生产控制与维修计划协同决策,降低生产成本。首先描述生产过程,分析各项费用。其次,建立了考虑生产过程失控、故障率和故障停时间的生产过程控制、生产计划优化和维修管理联合优化决策的模型。通过模型求解,联合制定出生产过程检查策略、生产计划（经济生产批量、生产批次）以及维修计划（PM间隔期）,实现单位时间内总费用最低的目标。再次,案例研究,分析生产过程失控、故障率和故障停机时间对于经济生产批量、生产过程检查策略和生产系统维修计划的影响。该模型从理论上解决了生产过程控制、生产计划优化和维修管理联合优化决策难题,对于指导企业制定生产计划和生产系统的检修计划,进而提高产品质量、降低生产成本、确保准时交货都具有指导意义和实用价值。     

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.     

An Evolutionary Algorithm for Sequencing Production on a Paced Assembly Line

A new sequencing method for mixed‐model assembly lines is developed and tested. This method, called the Evolutionary Production Sequencer (EPS) is designed to maximize production on an assembly line. The performance of EPS is evaluated using three measures: minimum cycle time necessary to achieve 100% completion without rework, percent of items completed without rework for a given cycle time, and sequence “smoothness.” The first two of these measures are based on a simulated production system. Characteristics of the system, such as assembly line station length, assembly time and cycle time, are varied to better gauge the performance of EPS. More fundamental variation is studied by modeling two production systems. In one set of tests, the system consists of an assembly line in isolation (i.e., a single‐level system). In another set of tests, the production system consists of the assembly line and the fabrication system supplying components to the line (i.e., a two‐level system). Sequence smoothness is measured by the mean absolute deviation (MAD) between actual component usage and the ideal usage at each point in the production sequence. The performance of EPS is compared to those of well‐known assembly line sequencing techniques developed by Miltenburg (1989), Okamura and Yamashina (1979), and Yano and Rachamadugu (1991). EPS performed very well under all test conditions when the criterion of success was either minimum cycle time necessary to achieve 100% production without rework or percent of items completed without rework for a given cycle time. When MAD was the criterion of success, EPS was found inferior to the Miltenburg heuristic but better than the other two production‐oriented techniques.     

Managing appointments with waiting time targets and random walk-ins

The random arrivals of walk-in patients significantly affect the daily operations of healthcare facilities. To improve the performance of outpatient departments, this paper attempts to make an appointment schedule by considering walk-ins and the waiting time target (WTT) for appointment patients. A stochastic programming model is proposed to solve this problem with the objective of minimizing the weighted patient waiting and makespan cost. A non-decreasing waiting cost function is used to capture the WTT fulfillment of appointment patients, whereas walk-ins incur a linear waiting cost. A finite-horizon Markov Decision Process model is formulated to establish the optimal real-time scheduling policy under a given appointment schedule. The appointment schedule is determined by a two-stage stochastic programming approximation and a local search improvement. Structural properties of the optimal appointment scheduling and real-time scheduling policies are established. In particular, it is shown that appointment overbooking is allowed only at the end of the regular session, and the optimal real-time scheduling policy is an easy-to-implement threshold policy with bounded sensitivity. Numerical experiments based on real data are performed to investigate the influence of different parameters and to compare different schedules. The optimal schedule demonstrates superior performance by allowing reasonable waiting times for appointment patients depending on their WTTs. Managerial insights are also provided to hospital managers. Finally, the basic model is extended by incorporating random service times and random arrivals of appointment patients. The latter includes the random number of patients that show up for service or call for appointments, and the random arrival time (unpunctuality). Appointment overbooking strategies are shown to have different structures under some stochastic factors.     

Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach

In today's fast-paced Just-In-Time and mass customization manufacturing in a sequence-dependent setup environment, the challenge of making production schedules to meet due-date requirements is becoming a more complex problem. Unfortunately, much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. This paper considers the problem of minimizing tardiness, a common measure of due-date performance, in a sequence-dependent setup environment. Simulated annealing was used to solve the sequencing problem, and its performance was compared with random search. Our experimental results show that the algorithm can find a good solution fairly quickly, and thus can rework schedules frequently to react to variations in the schedule. The algorithm is invaluable for ‘on-line’ production scheduling and ‘last-minute’ changes to production schedule. The results of this research also suggest ways in which more complex and realistic job shop environments, such as multiple machines with a higher number of jobs in the sequence, and other scheduling objectives can be modeled. This research also investigates computational aspects of simulated annealing in solving complex scheduling problems.     

Optimal algorithms for online time series search and one-way trading with interrelated prices

The basic models of online time series search and one-way trading are introduced by El-Yaniv et al. in Algorithmica 30(1), 101–139 (2001) where it is assumed that the prices are bounded within interval [m,M] (0<m<M). In this paper, we consider another case where every two consecutive prices are interrelated, that is, the variation range of each price depends on its preceding price. We present optimal deterministic online algorithms for the two problems, respectively. According to one conclusion in Algorithmica 30(1), 101–139 (2001), we further point out that for the case we considered, an optimal deterministic algorithm for the one-way trading problem can be regarded as an optimal randomized one for the time series search problem, and randomization is useless for the one-way trading problem.     

Statistical Process Control and Condition‐Based Maintenance: A Meaningful Relationship through Data Sharing

This paper focuses on the close relationship between statistical process control and preventive maintenance (PM) of manufacturing equipment. The context is very general: a production process that is characterized by multiple distinct operational states and a failure state. The operational states differ in terms of operational/quality costs and/or the proneness to complete failure. The times of shift from the normal operational state to an inferior one and the times to failure are random variables, not necessarily exponentially distributed. The process is monitored with a control chart with the purpose of quickly detecting shifts to an inferior operational state due to the occurrence of some unobservable assignable cause. At the same time, the information collected from the process may be used to re‐schedule the planned PM, if there is evidence that a failure is imminent. The two mechanisms are obviously related, especially if they are based on measurements of the same critical process characteristic. Yet, they are typically treated independently. We develop a fairly general mathematical model for the joint optimization of the control chart parameters and the maintenance times. Numerical investigation using this model shows that ignoring the close relationship between process control and maintenance results in inefficiencies that may be substantial. It also provides practical insights about the effects of some key problem characteristics on the optimal joint design of process control and maintenance.     

Multistage Stochastic Optimization for Production‐Inventory Planning with Intermittent Renewable Energy

A growing number of companies install wind and solar generators in their energy‐intensive facilities to attain low‐carbon manufacturing operations. However, there is a lack of methodological studies on operating large manufacturing facilities with intermittent power. This study presents a multi‐period, production‐inventory planning model in a multi‐plant manufacturing system powered with onsite and grid renewable energy. Our goal is to determine the production quantity, the stock level, and the renewable energy supply in each period such that the aggregate production cost (including energy) is minimized. We tackle this complex decision problem in three steps. First, we present a deterministic planning model to attain the desired green energy penetration level. Next, the deterministic model is extended to a multistage stochastic optimization model taking into account the uncertainties of renewables. Finally, we develop an efficient modified Benders decomposition algorithm to search for the optimal production schedule using a scenario tree. Numerical experiments are carried out to verify and validate the model integrity, and the potential of realizing high‐level renewables penetration in large manufacturing system is discussed and justified.     

OPTIMAL AND NEAR OPTIMAL CONTROL OF A TWO-PART-TYPE STOCHASTIC MANUFACTURING SYSTEM WITH DYNAMIC SETUPS

This paper deals with a manufacturing system consisting of a single machine subject to random failures and repairs. The machine can produce two types of parts. When the production is switched from one part type to the other, a random setup time is incurred at a constant cost rate. The objective is to track the demand, while keeping the work-in-process as close as possible to zero for both products. The problem is formulated as an optimal stochastic control problem. The optimal policy is obtained numerically by discretizing the continuous time continuous state opti-mality conditions using a Markov chain approximation technique. The discretized optimality conditions are shown to correspond to an infinite horizon, discrete time, discrete state dynamic programming problem. The optimal setup policy is shown to have two different structures depending on the parameters of the system. A heuristic policy is proposed to approximate the optimal setup policy. Simulation results show that the heuristic policy is a very good approximation for sufficiently reliable systems.     

Production and changeover control policies of a class of failure prone buffered flow-shops

This article deals with a stochastic optimal control problem for a class of buffered multi-parts flow-shops manufacturing system. The involved machines are subject to random breakdowns and repairs. The flow-shop under consideration is not completely flexible and hence requires setup time and cost in order to switch the production from a part type to another, this changeover is carried on the whole line. Our objective is to find the production plan and the sequence of setups that minimise the cost function, which penalises inventories/backlogs and setups. A continuous dynamic programming formulation of the problem is presented. Then, a numerical scheme is adopted to solve the obtained optimality conditions equations for a two buffered serial machines two parts case. A complete heuristic policy, based on the numerical observations which describe the optimal policies in system states, is developed. It will be shown that the obtained policy is a combination of a KANBAN/CONWIP and a modified hedging corridor policy. Moreover, based on our observations and existent research studies extension to cover more complex flow-shops is henceforth possible. The robustness of such a policy is illustrated through sensitivity analysis.     

Applying statistical tests to empirically compare tabu search parameters for MAX 3-SATISFIABILITY: A case study

The application of stochastic heuristic, like tabu search or simulated annealing, to address hard discrete optimization problems has been an important advance for efficiently obtaining good solutions in a reasonable amount of computing time. A challenge when applying such heuristics is assessing when a particular set of parameter values yields better performance compared to other such sets of parameter values. For example, it can be difficult to determine the optimal mix of memory types to incorporate into tabu search. This in turn prompts users to undertake a trial and error phase to determine the best combination of parameter settings for the problem under study. Moreover, for a given problem instance, one set of heuristic parameter settings may yield a better solution than another set of parameters, for a given initial solution. However, the performance of this heuristic on this instance for a single heuristic execution is not sufficient to assert that the first set of parameter settings will always produce superior results than the second set of parameters, for all initial solutions.     

Optimal maintenance intervals for a multi-component system

In the manufacturing industry, preventive maintenance (PM) is carried out to minimise the probability of plant unexpected breakdown. Planned PM is preferred as disruption to operation is then minimised. Suggested PM intervals are normally prepared by the original equipment manufacturers (OEMs), however due to the multifaceted relationship between operating context and production requirement for different plants, it is unlikely that these suggested intervals as prescribed by the OEMs are optimal. Reliability, budget and breakdown outages cost are some of the critical factors that will affect the calculation of optimal maintenance intervals. Maintenance managers are required to determine optimal maintenance intervals with the above different requirements set by management. In this paper three models are proposed to calculate optimal maintenance intervals for multi-component system in a factory subjected to minimum required reliability, maximum allowable budget and minimum total cost. Numerical examples are provided to illustrate the application and usefulness of the proposed models.     

Joint production and subcontracting planning of unreliable multi-facility multi-product production systems

This article addresses the problem of joint optimization of production and subcontracting of unreliable production systems. The production system considered presents a common problem in the pharmaceutical industry. It is composed of multiple production facilities with different capacities, each of which is capable of producing two different classes of medications (brand name and generic). The resort to subcontracting is double: first, it involves the quantity of products received on a regular basis in order to compensate for insufficient production capacity in existing facilities, second, when needed, urgent orders are also launched in order to reduce the risk of shortages caused by breakdowns of manufacturing facilities. Failures, repairs and urgent delivery times may be represented by any probability distributions.The objective is to propose a general control policy for the system under consideration, and to obtain, in the case of two facilities, optimal control parameters that minimize the total incurred cost for a specific level of the customer service provided. Given the complexity of the problem considered, an experimental optimization approach is chosen in order to determine the optimal control parameters. This approach includes experimental design, analysis of variance, response surface methodology and simulation modeling. It allows the accurate representation of the dynamic and stochastic behaviors of the production system and the assessment of optimal control parameters. Other control parameters which represent the subcontracting are introduced and three joint production/subcontracting control policies (general, urgent, regular) are compared to one another. The proposed joint production/regular subcontracting control policy involves a cost decrease of up to 20%, as compared to results obtained by Dror et al. [1], who used a simplified control policy in addition to a heuristic solution approach for a real case study. This policy offers not only cost savings, but is also easier to manage, as compared to that proposed by Dror et al. [1]. Numerical examples and a sensitivity analysis are also performed to illustrate the robustness of the proposed control policy and the solution approach.     

Inventory Rationing in a Make‐to‐Stock System with Batch Production and Lost Sales

We address an inventory rationing problem in a lost sales make‐to‐stock (MTS) production system with batch ordering and multiple demand classes. Each production order contains a single batch of a fixed lot size and the processing time of each batch is random. Assuming that there is at most one order outstanding at any point in time, we first address the case with the general production time distribution. We show that the optimal order policy is characterized by a reorder point and the optimal rationing policy is characterized by time‐dependent rationing levels. We then approximate the production time distribution with a phase‐type distribution and show that the optimal policy can be characterized by a reorder point and state‐dependent rationing levels. Using the Erlang production time distribution, we generalize the model to a tandem MTS system in which there may be multiple outstanding orders. We introduce a state‐transformation approach to perform the structural analysis and show that both the reorder point and rationing levels are state dependent. We show the monotonicity of the optimal reorder point and rationing levels for the outstanding orders, and generate new theoretical and managerial insights from the research findings.     

考虑道路通行能力的应急避难点选址模型及算法

在k-中心点问题的基础上,考虑道路的通行能力限制,提出了k-避难点问题。在一般树图结构下,重点分析了1-避难点选址问题,并设计了有效的求解算法;在直线图结构下,首先改进了一般图1-避难点的求解算法,其次分析了2-避难点问题的特点,并给出了一个基于"二分思想"的求解算法,在此基础上,为一般的直线图k-避难点问题设计了求解算法,一般算法的时间复杂性为O(nlog^kn)。所提出的模型在理论上扩展了经典的k-中心点选址问题,所设计的求解算法能够为现实的应急管理规划提供良好的理论支持。     

Lifecycle Pricing for Installed Base Management with Constrained Capacity and Remanufacturing

Installed base management is the policy in which the manufacturer leases the product to consumers, and bundles repair and maintenance services along with the product. In this article, we investigate for the optimal leasing price and leasing duration decisions by a monopolist when the production and servicing capacity are constrained. The effect of diffusion of consumers in the installed base is considered, with the ownership of the product resting with the monopolist during the product lifecycle. The monopolist operating the installed base jointly optimizes the profits from leasing the product/service bundle along with maintenance revenues and remanufacturing savings. We formulate the manufacturer's problem as an optimal control problem and show that the optimal pricing strategy of the firm should be a skimming strategy. We also find that the effect of remanufacturing savings on the pricing decision and the length of the leasing duration changes significantly depending on the duration of the product's lifecycle. If the product lifecycle is long and remanufacturing savings are low, the firm should offer a shorter leasing duration, whereas if the remanufacturing savings are high, the firm should optimally offer a higher leasing duration. In contrast, if the time duration of the product lifecycle is low and remanufacturing savings are low, the firm prefers to offer a shorter leasing duration, whereas if the remanufacturing savings are high, the firm should optimally have a longer leasing duration. The article also shows that if the production capacity is small, the manufacturer increases the leasing duration. If the production capacity is very small, the manufacturer sets the leasing duration to be equal to the product lifecycle and does not use remanufacturing.