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 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.     

Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities

This paper addresses a single-machine scheduling problem with simultaneous consideration of due-date assignment, generalised position-dependent deteriorating jobs, and deteriorating maintenance activities. It is assumed that the actual processing time of a job is a general non-decreasing function depending on the number of maintenance activities performed before it and its position in a sequence. Moreover, the machine may be subject to several maintenance activities up to a limit over the scheduling horizon. The maintenance activities do not necessarily restore the machine fully to its original perfect state and the duration of a maintenance activity depends on its start time. The objective is to find jointly the optimal job sequence, maintenance frequency and maintenance positions to minimise an objective function that includes the cost of due-date assignment, the cost of discarding jobs that cannot be completed by their due dates and the earliness of the scheduled jobs under the popular CON and SLK due-date assignment methods. We provide polynomial-time solution algorithms for various versions of the problem.     

Scheduling with non-decreasing deterioration jobs and variable maintenance activities on a single machine

There is a situation found in many manufacturing systems, such as steel rolling mills, fire fighting or single-server cycle-queues, where a job that is processed later consumes more time than that same job when processed earlier. The research finds that machine maintenance can improve the worsening of processing conditions. After maintenance activity, the machine will be restored. The maintenance duration is a positive and non-decreasing differentiable convex function of the total processing times of the jobs between maintenance activities. Motivated by this observation, the makespan and the total completion time minimization problems in the scheduling of jobs with non-decreasing rates of job processing time on a single machine are considered in this article. It is shown that both the makespan and the total completion time minimization problems are NP-hard in the strong sense when the number of maintenance activities is arbitrary, while the makespan minimization problem is NP-hard in the ordinary sense when the number of maintenance activities is fixed. If the deterioration rates of the jobs are identical and the maintenance duration is a linear function of the total processing times of the jobs between maintenance activities, then this article shows that the group balance principle is satisfied for the makespan minimization problem. Furthermore, two polynomial-time algorithms are presented for solving the makespan problem and the total completion time problem under identical deterioration rates, respectively.     

Integrated maintenance planning and production scheduling with Markovian deteriorating machine conditions

In many industries, production capacity diminishes as machine conditions deteriorate. Maintenance operations improve machine conditions, but also occupy potential production time, possibly delaying the customer orders. Therefore, one challenge is to determine the joint maintenance and production schedule to minimize the combined costs of maintenance and lost production over the long term. In this paper, we address the problem of integrated maintenance and production scheduling in a deteriorating multi-machine production system over multiple periods. Assuming that at the beginning of each period the demand becomes known and machine conditions are observable, we formulate a Markov decision process model to determine the maintenance plan and develop sufficient conditions guaranteeing its monotonicity in both machine condition and demand. We then formulate an integer programming model to find the maintenance and the production schedule in each period. Our computational results show that exploiting online condition monitoring information in maintenance and production decisions leads to 21% cost savings on average compared to a greedy heuristic and that the benefit of incorporating long-term information in making short-term decisions is highest in industries with medium failure rates.     

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

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

Scheduling preventive maintenance on a single CNC machine

In this study we attempt to deal with process planning, scheduling and preventive maintenance (PM) decisions, simultaneously. The objective is to minimize the total completion time of a set of jobs on a CNC machine. During the process planning, we decide on the processing times of the jobs which are controllable (i.e. they can be easily changed) on CNC machines. Using shorter processing times (higher production rates) would result in greater deterioration of the machine, and we would need to plan more frequent PM visits to the machine, during which it would not be available. Therefore, the selected processing times determine not only the completion times but also the PM visit times. We first provide optimality properties for the joint problem. We propose a new heuristic search algorithm to determine simultaneously the processing times of the jobs, their sequence and the PM schedule.     

Bi-objective optimisation for integrated scheduling of single machine with setup times and preventive maintenance planning

This paper deals with an integrated bi-objective optimisation problem for production scheduling and preventive maintenance in a single-machine context with sequence-dependent setup times. To model its increasing failure rate, the time to failure of the machine is subject to Weibull distribution. The two objectives are to minimise the total expected completion time of jobs and to minimise the maximum of expected times of failure of the machine at the same time. During the setup times, preventive maintenance activities are supposed to be performed simultaneously. Due to the assumption of non-preemptive job processing, three resolution policies are adapted to deal with the conflicts arising between job processing and maintenance activities. Two decisions are to be taken at the same time: find the permutation of jobs and determine when to perform the preventive maintenance. To solve this integrated problem, two well-known evolutionary genetic algorithms are compared to find an approximation of the Pareto-optimal front, in terms of standard multi-objective metrics. The results of extensive computational experiments show the promising performance of the adapted algorithms.     

A maintenance driven scheduling cockpit for integrated production and maintenance operation schedule

The production and maintenance functions have objectives that are often in contrast and it is essential for management to ensure that their activities are carried out synergistically, to ensure the maximum efficiency of the production plant as well as the minimization of management costs. The current evolution of ICT technologies and maintenance strategies in the industrial field is making possible a greater integration between production and maintenance. This work addresses this challenge by combining the knowledge of the data collected from physical assets for predictive maintenance management with the possibility of dynamic simulate the future behaviour of the manufacturing system through a digital twin for optimal management of maintenance interventions. The paper, indeed, presents a supporting digital cockpit for production and maintenance integrated scheduling. The tool proposes an innovative approach to manage health data from machines being in any production system and provides support to compare the information about their remaining useful life (RUL) with the respective production schedule. The maintenance driven scheduling cockpit (MDSC) offers, indeed, a supporting decision tool for the maintenance strategy to be implemented that can help production and maintenance managers in the optimal scheduling of preventive maintenance interventions based on RUL estimation. The simulation is performed by varying the production schedule with the maintenance tasks involvement; opportune decisions are taken evaluating the total costs related to the simulated strategy and the impact on the production schedule.The full text can be downloaded at https://link.springer.com/article/10.1007/s40436-021-00380-z     

Single-machine scheduling with deteriorating effects and machine maintenance

In this paper, the single-machine scheduling problems with deteriorating effects and a machine maintenance are studied. In this circumstance, the deterioration rates of the jobs during the machining process are the same which reduces the production efficiency. The actual processing time of the job is a linearly increasing function of the starting time. In this process, the machine only performs a maintenance activity, and the maintenance time is a fixed value. After the maintenance work is completed, the machine will be restored to the initial state, and the deterioration of the job will be start again. The goal is to determine the optimal schedule in order to minimise the maximum completion time (i.e. the makespan) and the sum of job completion times. We prove that both problems are polynomial time solvable, and we also provide the corresponding algorithms.     

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.     

Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method

This paper investigates an integrated bi-objective optimisation problem with non-resumable jobs for production scheduling and preventive maintenance in a two-stage hybrid flow shop with one machine on the first stage and m identical parallel machines on the second stage. Sequence-dependent set-up times and preventive maintenance (PM) on the first stage machine are considered. The scheduling objectives are to minimise the unavailability of the first stage machine and to minimise the makespan simultaneously. To solve this integrated problem, three decisions have to be made: determine the processing sequence of jobs on the first stage machine, determine whether or not to perform PM activity just after each job, and specify the processing machine of each job on the second stage. Due to the complexity of the problem, a multi-objective tabu search (MOTS) method is adapted with the implementation details. The method generates non-dominated solutions with several parallel tabu lists and Pareto dominance concept. The performance of the method is compared with that of a well-known multi-objective genetic algorithm, in terms of standard multi-objective metrics. Computational results show that the proposed MOTS yields a better approximation.     

Preventive maintenance of a batch production system under time-varying operational condition

This paper proposes a dynamic opportunistic preventive maintenance (PM) strategy for a production system with a time-varying batch production pattern. The operation of such a system is generic in that the operational condition (OC) varies from batch to batch and the information about the next batch can be confirmed only upon the completion of the current batch. To accommodate time-varying OC, a modified imperfect maintenance model is developed to optimise the performance of maintenance actions that can only be performed at batch-shift points. The first study presents a PM policy for a single machine with short-term production plans. Then, a multi-machine system is studied with a goal of developing an optimum dynamic opportunistic PM strategy for a group of machines at batch-shift points. Numerical examples are proceeded to illustrate the proposed maintenance strategy in practice. The result reveals that more cost will be incurred if OC is ignored. Moreover, the proposed opportunistic PM strategy achieves the lowest total cost comparing with other strategies as the system downtime cost and maintenance cost has been jointly minimised.     

Real-time health prognosis and dynamic preventive maintenance policy for equipment under aging Markovian deterioration

An often seen practice of preventive maintenance (PM) is to construct a machine's reliability model based on its historical failure records. The reliability model is then used to determine the PM schedule by minimizing the machine's long-run operation cost or average machine downtime. Machines in many hi-tech manufacturing sectors are using sophisticated sensor technologies to provide sufficient immediate online data for real-time observation of equipment condition. Not only is the historical data but also the real time condition now available for scheduling a more effective PM policy. This research is to determine an effective PM policy based on real-time observations of equipment condition. We first use the multivariate process capability index to integrate the equipment's multiple parameters into an overall equipment health index. This health index serves as the basis for real-time health prognosis under an aging Markovian deterioration model. A dynamic PM schedule is then determined based on the health prognosis.     

Multi-threaded simulated annealing for a bi-objective maintenance scheduling problem

A parallel Simulated Annealing algorithm with multi-threaded architecture is proposed to solve a real bi-objective maintenance scheduling problem with conflicting objectives: the minimisation of the total equipment downtime caused by maintenance jobs and the minimisation of the multi-skilled workforce requirements over the given horizon. The maintenance jobs have different priorities with some precedence relations between different skills. The total weighted flow time is used as a scheduling criterion to measure the equipment availability. The multi-threaded architecture is used to speed up a multi-objective Simulated Annealing algorithm to solve the considered problem. Multi-threading is a form of parallelism based on shared memory architecture where multiple logical processing units, so-called threads, run concurrently and communicate via shared memory. The performance of the parallel method compared to the exact method is verified using a number of test problems. The obtained results imply the high efficiency and robustness of the proposed heuristic for both solution quality and computational effort.     

Quality issue in forecasting problem of production and maintenance policy for production unit

In this study, we consider an unreliable deteriorating production system that produces conforming and non-conforming products to satisfy a random demand under a given service level and during a finite horizon. The production system is subjected to a failure-prone machine. The quality of the produced products is affected by the machine deterioration since the rate of defectives increases as the deterioration increases. Preventive maintenance actions can be piloted on the production system to reduce the influence of deterioration and the defective rate. A joint control policy is based on a stochastic production and maintenance planning problem with goals to determine, firstly, the economic plan of production and secondly, the optimal maintenance strategy. The proposed jointly optimisation minimises the total cost of production, inventory, maintenance and defectives. A failure rate and quality relationship are defined to show the influence of the production rates variation on the failures rate as well as on the defective rate. A numerical example and an industrial case study are adopted to illustrate the proposed approach and a sensitivity analysis to validate the jointly optimisation.     

Scheduling with shutdowns and sequence dependent set-up times

This paper considers a single machine scheduling problem with ready and due times constraints on jobs, shutdown constraints on the machine and sequence dependent set-up times among jobs. The shutdown is a disruptive event such as holiday, breaks or machine maintenance, and has a prespecified period when the machine will be interrupted. If no pre-emption is allowed for jobs, shutdown constraints divide the planning horizon into disconnected time windows. An optimization algorithm based on the branch-and-bound method is developed to minimize the maximum tardiness for solving the problem. This paper further develops the post-processing algorithm that manipulates the starting time of the shutdown period so as to reduce the obtained maximum tardiness. The post-processing algorithm can determine plural schedules to reduce the maximum tardiness, and the production manager will select the objective schedule among them for the interest of overall efficiency. Computational results for the proposed algorithms will indicate that the post-processing algorithm can improve upon the original solution and the problems with multiple shutdowns and with set-up times varying widely can be satisfactorily solved.     

Simulation study of a bottleneck-based dispatching policy for a maintenance workforce

Maintenance is important for production operations and for continuous improvement. Appropriate dispatching of the maintenance workforce to quickly respond to equipment failures and carry out preventive services can improve system productivity. The first-come-first-served policy is typically used in many manufacturing industries. In this paper, we present a priority-based dispatching policy, a dynamic bottleneck policy, based on the analysis of real-time data. In such a policy, priority is assigned to the bottleneck machine after a fixed time period, and the maintenance worker will service the high-priority machine (i.e. bottleneck machine) first when multiple service requests are received. It is shown by extensive simulation experiments that this policy can lead to a greater improvement in system throughput compared with the first-come-first-served policy. To implement such a policy, the appropriate time period for data collection and the frequency for carrying out bottleneck analysis are investigated. In addition, a sensitivity study suggests that the results obtained are insensitive to machine downtime, efficiency, and reliability models.     

Power plant maintenance scheduling using ant colony optimization: an improved formulation

It is common practice in the hydropower industry to either shorten the maintenance duration or to postpone maintenance tasks in a hydropower system when there is expected unserved energy based on current water storage levels and forecast storage inflows. It is therefore essential that a maintenance scheduling optimizer can incorporate the options of shortening the maintenance duration and/or deferring maintenance tasks in the search for practical maintenance schedules. In this article, an improved ant colony optimization-power plant maintenance scheduling optimization (ACO-PPMSO) formulation that considers such options in the optimization process is introduced. As a result, both the optimum commencement time and the optimum outage duration are determined for each of the maintenance tasks that need to be scheduled. In addition, a local search strategy is presented in this article to boost the robustness of the algorithm. When tested on a five-station hydropower system problem, the improved formulation is shown to be capable of allowing shortening of maintenance duration in the event of expected demand shortfalls. In addition, the new local search strategy is also shown to have significantly improved the optimization ability of the ACO-PPMSO algorithm.     

Predictable scheduling of a single machine with breakdowns and sensitive jobs

Production schedules released to the shop floor have two important functions: allocating shop resources to different jobs to optimize some measure of shop performance and serving as a basis for planning external activities such as material procurement, preventive maintenance and delivery of orders to customers. Schedule modification may delay or render infeasible the execution of external activities planned on the basis of the predictive schedule. Thus it is of interest to develop predictive schedules that can absorb disruptions without affecting planned external activities while maintaining high shop performance. We present a predictable scheduling approach, that inserts additional idle time into the schedule to absorb the impacts of breakdowns. The effects of disruptions on planned support activities are measured by the deviations of job completion times in the realized schedule from those in the predictive schedule. We apply our approach to minimizing total tardiness on a single machine with stochastic machine failures. We then extend the procedure to consider the case where job processing times are affected by machine breakdowns, and provide specialized rescheduling heuristics. Extensive computational experiments show that this approach provides high predictability with minor sacrifices in shop performance.