Periodic flexible maintenance planning in a single-machine production environment
Authors
Abstract:
Preventive maintenance is the essential part of many maintenance plans. From the production point of view, the flexibility of the maintenance intervals enhances the manufacturing efficiency. On the contrary, the maintenance departments tend to know the timing of the long term maintenance plans as certain as possible. In a single-machine production environment, this paper proposes a simulation–optimization approach which establishes periodic flexible maintenance plans by determining the time between the maintenance intervals and the flexibility (i.e., length) of each interval. The objective is the minimization of the estimated total costs of the corrective and preventive maintenance, the undesirability of the flexibility (i.e., uncertainty) in maintenance timing, and the tardiness and long due date costs of jobs. Two mixed continuous-discrete variations of the ant colony optimization algorithm and the particle swarm optimization algorithm are developed as the solution approaches. Numerical studies are used to compare the performance of these algorithms. Further, the average reduction of the total costs gained from the flexibility of maintenance intervals on a wide range of parameters is reported.
similar resources
JIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
full textSingle-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness
full text
Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
Article history: Received 19 January 2009 Received in revised form 17 April 2009 Accepted 30 April 2009 Available online 7 May 2009
full textA Single Machine Capacitated Production Planning Problem Under Uncertainty: A Grey Linear Programming Approach
The production planning is an important problem in most of manufacturing systems in practice. Unlike many researches existing in literature, this problem encounters with great uncertainties in parameters and input data. In this paper, a single machine capacitated production planning problem is considered and a linear programming formulation is presented. The production costs are assumed to be u...
full texta heuristic algorithm for solving single machine scheduling problem with periodic maintenance
in this paper, the scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. the first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with a special tool. we have proposed a new ...
full textMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
full textMy Resources
Journal title
volume 15 issue 4
pages -
publication date 2019-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023