Maintenance,shutdown and production scheduling in semiconductor robotic cells

Our approach is the first to study simultaneous scheduling of preventive maintenance, shutdowns and production for robotic cells in semiconductor manufacturing. It hereby exploits the frequent periods of overcapacity in semiconductor manufacturing to reduce wear and tear. In contrast to existing approaches, our scheduling approach is able to deal with different preventive-maintenance types. We borrow the Resource Task Network representation from the process-industry domain to represent our problem and facilitate its formulation as a mathematical model. In addition, we develop efficiency-improving constraints based on the characteristics of the preventive-maintenance activities. In numerical tests based on industry data, we show that the model generates high-quality schedules even without applying the inequalities, although the optimality gap is reduced only when including inequalities. We furthermore assess the trade-off between shutdowns and batch lead times. We compare our model’s schedule quality to (i) the simple industry practice of shutting down chambers permanently to reduce wear and tear and (ii) an approach that schedules maintenance and production sequentially. The numerical tests yield the following managerial insights. First, integrating maintenance and production scheduling has substantial advantages. Second, the practice of shutting equipment down permanently diminishes scheduling flexibility and solution quality. Third, shutdowns scheduling must also consider the impact on batch waiting times.     

Using 0/1 mixed integer linear programming to solve a reliability-centered problem of power plant preventive maintenance scheduling

The problem of power plant preventive maintenance scheduling is studied in this paper. A reliability perspective is considered. This problem consists of ascertaining which generating units must halt production to be examined regularly for safety. It is very important because a failure in a power station may cause a general breakdown in an electric network. The main consequence is that the electricity demand of customers will not be satisfied in such cases. Therefore, reliability is the key point used in the methodology presented. The problem is approached under the operations research perspective as an optimization issue. 0/1 mixed integer linear programming is used to solve the model reached. An application study is included. The model is put to use in a real power plant setting, representative of the Spanish one. The result obtained is a schedule that allows the efficient organization of preventive maintenance over a specific time horizon.     

Influence of load diversity exchange on preventive maintenance scheduling in interconnected power systems

Preventive maintenance scheduling in a power system can be performed in a number of ways. One approach is to levelize the risk throughout the study period. This paper presents a practical approach to risk levelization. These concepts are extended to maintenance scheduling in two interconnected systems. Power system interconnection can have a significant effect on the maintenance schedules of the connected systems. This effect will depend on the individual system parameters such as generating unit sizes, forced outage rates, and on the interconnection capabilities and availabilities. The individual load characteristics in each system also have a major impact on both the isolated system and interconnected configuration maintenance schedules. This paper illustrates the influence of load diversity exchange on the preventive maintenance schedule in two interconnected systems using the risk levelization approach. The concepts are examined using the IEEE Reliability Test System.     

Optimal generator maintenance scheduling using a modified discrete PSO

A modified discrete particle swarm optimisation (MDPSO) algorithm to generate optimal preventive maintenance schedule of generating units for economical and reliable operation of a power system, while satisfying system load demand and crew constraints, is presented. Discrete particle swarm optimisation (DPSO) is known to effectively solve large-scale multi-objective optimisation problems and has been widely applied in power system. The MDPSO proposed for the generator maintenance scheduling optimisation problem generates optimal and feasible solutions and overcomes the limitations of the conventional methods, such as extensive computational effort, which increases exponentially as the size of the problem increases. The efficacy of the proposed algorithm is illustrated and compared with the genetic algorithm (GA) and DPSO in two case studies ? a 21-unit test system and a 49-unit system feeding the Nigerian national grid. The MDPSO algorithm is found to generate schedules with comparatively higher system reliability indices than those obtained with GA and DPSO.     

Modelling and optimizing sequential imperfect preventive maintenance

This paper deals with the problem of scheduling imperfect preventive maintenance (PM) of some equipment. It uses a model due to Kijima in which each application of PM reduces the equipment's effective age (but without making it as good as new). The approach presented here involves minimizing a performance function which allows for the costs of minimal repair and eventual system replacement as well as for the costs of PM during the equipment's operating lifetime. The paper describes a numerical investigation into the sensitivity of optimum schedules to different aspects of an age-reduction model (including the situation when parts of a system are non-maintainable—i.e., unaffected by PM).     

A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance

This paper considers the problem of minimising makespan on a single batch processing machine with flexible periodic preventive maintenance. This problem combines two sub-problems, scheduling on a batch processing machine with jobs’ release dates considered and arranging the preventive maintenance activities on a batch processing machine. The preventive maintenance activities are flexible but the maximum continuous working time of the machine, which is allowed, is determined. A mathematical model for integrating flexible periodic preventive maintenance into batch processing machine problem is proposed, in which the grouping of jobs with incompatible job families, the starting time of batches and the preventive maintenance activities are optimised simultaneously. A method combining rules with the genetic algorithm is proposed to solve this model, in which a batching rule is proposed to group jobs with incompatible job families into batches and a modified genetic algorithm is proposed to schedule batches and arrange preventive maintenance activities. The computational results indicate the method is effective under practical problem sizes. In addition, the influences of jobs’ parameters on the performance of the method are analyzed, such as the number of jobs, the number of job families, jobs’ processing time and jobs’ release time.     

生产调度与维护集成的多目标Lorenz非劣遗传优化

研究了一种单机环境下集成生产和维护的双目标优化调度问题。机床的故障间隔时间和平均维修时间服从指数分布,同时结合加工序列相关准备时间。预防性维护活动不能与作业加工同时进行,但与准备时间不相冲突。调度目标是同时最小化作业总计完成时间和机床不可得性。在问题建模的基础上,构造了一种基于Lorenz非劣关系的分类遗传算法(表示为L-NSGA-Ⅱ),详细设计了算法的核心部分。最后,通过大量计算实验,将L-NSGA-II算法与NSGA-II算法进行了比较分析,说明了L-NSGA-II算法的有效性。     

Decision-making on multi-mould maintenance in production scheduling

The reliability of a critical tool like a mould on a machine affects the productivity seriously in many manufacturing firms. In fact, its breakdown frequency is even higher than machines. The decision-making on when mould maintenance should be started become a challenging issue. In the previous study, the mould maintenance plans were integrated with the traditional production schedules in a plastics production system. It was proven that considering machine and mould maintenance in production scheduling could improve the overall reliability and productivity of the production system. However, the previous model assumed that each job contained single operation. It is not workable in other manufacturing systems such as die stamping which may contain multiple operations with multiple moulds in each job. Thus, this study models a new problem for multi-mould production-maintenance scheduling. A genetic algorithm approach is applied to minimise the makespan of all jobs in 10 hypothetical problem sets. A joint scheduling (JS) approach is proposed to decide the start times of maintenance activities during scheduling. The numerical result shows that the JS approach has a good performance in the new problem and it is sensitive to the characteristic of the setup time defined.     

A full history proportional hazards model for preventive maintenance scheduling

This paper is concerned with the development of a realistic preventive maintenance (PM) scheduling model. A heuristic approach for implementing the semi-parametric proportional-hazards model (PHM) to schedule the next preventive maintenance interval on the basis of the equipment's full condition history is introduced. This heuristic can be used with repairable systems and does not require the unrealistic assumption of renewal during repair, or even during PM. Two PHMs are fitted, for the life of equipment following corrective work and the life of equipment following PM, using appropriate explanatory variables. These models are then used within a simulation framework to schedule the next preventive maintenance interval. Optimal PM schedules are estimated using two different criteria, namely maximizing availability over a single PM interval and over a fixed horizon. History data from a set of four pumps operating in a continuous process industry is also used to demonstrate the proposed approach. The results indicate a higher availability for the recommended schedule than the availability resulting from applying the optimal PM intervals as suggested by using the conventional stationary models. © 1997 John Wiley & Sons, Ltd.     

Lagrangian relaxation method for price-based unit commitment problem

The unit commitment problem consists of determining the schedules for power generating units and the generating level of each unit. The decisions concern which units to commit during each time period and at what level to generate power to meet the electricity demand. The problem is a typical scheduling problem in an electric power system. The electric power industry is undergoing restructuring and deregulation. This article developes a stochastic programming model which incorporates power trading. The uncertainty of electric power demand or electricity price are incorporated into the unit commitment problem. It is assumed that demand and price uncertainty can be represented by a scenario tree. A stochastic integer programming model is proposed in which the objective is to maximize expected profits. In this model, on/off decisions for each generator are made in the first stage. The approach to solving the problem is based on Lagrangian relaxation and dynamic programming.     

汽车维修服务站瓶颈工序的实时调度

在结合优化调度理论和约束理论的基础上,从最小化目标、机器环境、加工特征和约束几方面分析了汽车维修服务站瓶颈工序的实时调度问题的特征,建立了对应的数学模型。根据问题特性,设计了包含复合动态分派规则的启发式调度算法。以实例分析验证了算法的可行性,仿真结果展示了所用算法在优化目标函数值上的优越性和计算时间的可行性。     

A probabilistic computational framework for bridge network optimal maintenance scheduling

This paper presents a probabilistic computational framework for the Pareto optimization of the preventive maintenance applications to bridges of a highway transportation network. The bridge characteristics are represented by their uncertain reliability index profiles. The in/out of service states of the bridges are simulated taking into account their correlation structure. Multi-objective Genetic Algorithms have been chosen as numerical tool for the solution of the optimization problem. The design variables of the optimization are the preventive maintenance schedules of all the bridges of the network. The two conflicting objectives are the minimization of the total present maintenance cost and the maximization of the network performance indicator. The final result is the Pareto front of optimal solutions among which the managers should chose, depending on engineering and economical factors. A numerical example illustrates the application of the proposed approach.     

Electroplating production scheduling by cyclogram unfolding in dynamic hoist scheduling problem

This article presents a scheduling problem that exists in electroplating lines. An electroplating line is an automated manufacturing system which covers machine parts with a coat of metal. It consists of a set of tanks that chemically process the items and hoists that transport the items between workstations. Scheduling the movements of these hoists is commonly called a hoist scheduling problem. The most common approaches to the problem are cyclic hoist scheduling problem and dynamic hoist scheduling problem (DHSP). This article presents a DHSP solution method. The method divides the problem into real time and non-real time. Special schedules, called cyclograms, allow minimisation of the length of non-real time calculations. A notion of the problem is introduced, an outline of a scheduling system is presented, as well as the heuristic algorithm itself. The results of the described method, referred to as a cyclogram unfolding method, are compared to several cases available in the literature.     

A mixed-integer linear programming model for integrated production and preventive maintenance scheduling in the capital goods industry

The scheduling literature is extensive, but much of this work is theoretical and does not capture the complexity of real world systems. Capital goods companies produce products with deep and complex product structures, each of which requires the coordination of jobbing, batch, flow and assembly processes. Many components require numerous operations on multiple machines. Integrated scheduling problems simultaneously consider two or more simultaneous decisions. Previous production scheduling research in the capital goods industry has neglected maintenance scheduling and used metaheuristics with stochastic search that cannot guarantee an optimal solution. This paper presents a novel mixed integer linear programming model for simultaneously solving the integrated production and preventive maintenance scheduling problem in the capital goods industry, which was tested using data from a collaborating company. The objective was to minimise total costs including: tardiness and earliness penalty costs; component and assembly holding costs; preventive maintenance costs; and set-up, production, transfer and production idle time costs. Thus, the objective function and problem formulation were more extensive than previous research. The tool was successfully tested using data obtained from a collaborating company. It was found that the company’s total cost could be reduced by up to 63.5%.     

Maintenance scheduling for a manufacturing system of machines with adjustable throughput

This paper considers the problem of analyzing and optimizing joint schedules of maintenance and throughput adjustment operations in manufacturing systems. The purpose of joint scheduling of maintenance and throughput changing operations is to maximize the cost benefits of maintenance operations in manufacturing systems in which some or all of the machines can execute their function under different process settings, resulting in different machine and system throughputs. Such a capability enables one to strategically slow down more degraded machines or accelerate freshly maintained machines so that production targets can be met and maintenance operations can be offset to times when they are less intrusive on the manufacturing process. A Monte-Carlo-simulation-based method is proposed for the evaluation of cost effectiveness of any schedule of maintenance and throughput changing operations, and a genetic-algorithm-based method is proposed to enable searching for schedules that would maximize the cost benefits of these operations. A matrix chromosome representation of the joint schedules of maintenance and throughput adjustment operations is introduced and several mechanisms of chromosome evolution and selection are proposed and analyzed in numerical simulations of such manufacturing systems. Results indicate a good ability for the newly proposed methods to achieve a tradeoff between cost benefits of production and losses due to maintenance operations through strategic allocation of maintenance and throughput changing actions.     

Single machine group scheduling with family setups to minimize total tardiness

This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence-independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed-integer linear programming model capable of solving small-sized problems is described. In view of the NP-hard nature of the problem, two-phase heuristics including simulated annealing algorithms are proposed to find optimal or near-optimal schedules. Empirical results show that the proposed heuristic algorithms are quite effective in minimizing total tardiness for a single machine group scheduling problem with family setup times.     

Job Shop Scheduling with Due Dates and Operation Overlap Feasibility

The job shop problem with due dates is formulated to allow overlaps among successive operations on a job. Multiple transports of sub lots and existence of setup times are two applications where this formulation can result in technologically feasible schedules. A procedure is described for generating overlap schedules and it is applied to eight test problems from the literature. The resulting schedules are compared to alternative schedules involving tardiness or overtime. The results indicate that the procedure is effective in generating multiple transport schedules for the manager's consideration. The comparative data provide useful tradeoff information for evaluation of alternatives and indicate that multiple transport scheduling may sometimes be a very economical way to try to meet due dates without using overtime operations.     

Optimizing preventive maintenance for mechanical components using genetic algorithms

This paper presents periodic preventive maintenance (PM) of a system with deteriorated components. Two activities, simple preventive maintenance and preventive replacement, are simultaneously considered to arrange the PM schedule of a system. A simple PM is to recover the degraded component to some level of the original condition according to an improvement factor which is determined by a quantitative assessment process. A preventive replacement is to restore the aged component by a new one. The degraded behavior of components is modeled by a dynamic reliability equation, and the effect of PM activities to reliability and failure rate of components is formulated based on age reduction model. While scheduling the PM policy, the PM components within a system are first identified. The maintenance cost and the extended life of the system under any activities-combination, which represents what kind of activities taken for these chosen components, are analyzed for evaluating the unit-cost life of the system. The optimal activities-combination at each PM stage is decided by using genetic algorithm in maximizing the system unit-cost life. Repeatedly, the PM scheduling is progressed to the next stage until the system's unit-cost life is less than its discarded life. Appropriately a mechatronic system is used as an example to demonstrate the proposed algorithm.     

基于状态监测的设备寿命预测与预防维护规划研究进展

寿命预测和预防维护规划是基于状态监测的维护中对维护效果有重大影响的两个研究内容。本文对近年来这两方面的代表性工作进行了总结和多层次分类,特别突出“基于相似性的寿命预测方法”和“在线预防维护模型”等正逐步兴起的新的研究领域。本文进而讨论了各类方法的适用范围,最后展望了一些必要的、有价值的研究方向。     

The model of maintenance planning and production scheduling for maximising robustness

The accuracy of prediction and detection capability have a strong influence over the efficiency of the bottleneck, all equipment and the production system. The function of predictive scheduling is to obtain stable and robust schedules for a shop floor. The first objective is to present an innovative maintenance planning and production scheduling method. The approach consists of four modules: a database to collect information about failure-free times, a prediction module of failure-free times, predictive scheduling and rescheduling module, a module for evaluating the accuracy of prediction and maintenance performance. The second objective is to apply the proposed methods for a job shop scheduling problem. Usually, researchers who are concerned about maintenance scheduling do not take unexpected disturbances into account. They assume that machines are always available for processing tasks during the future-planned production time. Moreover, researches use the criteria that are not effective to deal with the situation of unpredicted failures. In this paper, a method based on probability theory is proposed for maintenance scheduling. For unpredicted failures, a rescheduling method is also proposed. The evaluation module which gives information about the degradation of each performance measure and the stability of a schedule is proposed.