16,103 research outputs found
Recommended from our members
Single machine scheduling with general positional deterioration and rate-modifying maintenance
We present polynomial-time algorithms for single machine problems with generalized positional deterioration effects and machine maintenance. The decisions should be taken regarding possible sequences of jobs and on the number of maintenance activities to be included into a schedule in order to minimize the overall makespan. We deal with general non-decreasing functions to represent deterioration rates of job processing times. Another novel extension of existing models is our assumption that a maintenance activity does not necessarily fully restore the machine to its original perfect state. In the resulting schedules, the jobs are split into groups, a particular group to be sequenced after a particular maintenance period, and the actual processing time of a job is affected by the group that job is placed into and its position within the group
Recommended from our members
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
We consider a scheduling problem on a single machine to minimize the makespan. The processing conditions are subject to cumulative deterioration, but can be restored by a single maintenance. We link the problem to the Subset-sum problem (if the duration of maintenance is constant) and to the Half-Product Problem (if the duration of maintenance depends on its start time). For both versions of the problem, we adapt the existing fully polynomial-time approximation schemes to our problems by handling the additive constants
Efficient heuristics for the parallel blocking flow shop scheduling problem
We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows modeling the scheduling process in companies with more than one factory, each factory with a flow shop configuration. Therefore, the proposed methods can solve the scheduling problem under the blocking constraint in both situations, which, to the best of our knowledge, has not been studied previously. In this paper, we propose a mathematical model along with some constructive and improvement heuristics to solve the parallel blocking flow shop problem (PBFSP) and thus minimize the maximum completion time among lines. The proposed constructive procedures use two approaches that are totally different from those proposed in the literature. These methods are used as initial solution procedures of an iterated local search (ILS) and an iterated greedy algorithm (IGA), both of which are combined with a variable neighborhood search (VNS). The proposed constructive procedure and the improved methods take into account the characteristics of the problem. The computational evaluation demonstrates that both of them –especially the IGA– perform considerably better than those algorithms adapted from the DPFSP literature.Peer ReviewedPostprint (author's final draft
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance
We study single machine scheduling problems with linear time-dependent deterioration effects and maintenance activities. Maintenance periods (MPs) are included into the schedule, so that the machine, that gets worse during the processing, can be restored to a better state. We deal with a job-independent version of the deterioration effects, that is, all jobs share a common deterioration rate. However, we introduce a novel extension to such models and allow the deterioration rates to change after every MP. We study several versions of this generalized problem and design a range of polynomial-time solution algorithms that enable the decision-maker to determine possible sequences of jobs and MPs in the schedule, so that the makespan objective can be minimized. We show that all problems reduce to a linear assignment problem with a product matrix and can be solved by methods very similar to those used for solving problems with positional effects
Combining time and position dependent effects on a single machine subject to rate-modifying activities
We introduce a general model for single machine scheduling problems, in which the actual processing times of jobs are subject to a combination of positional and time-dependent effects, that are job-independent but additionally depend on certain activities that modify the processing rate of the machine, such as, maintenance. We focus on minimizing two classical objectives: the makespan and the sum of the completion times. The traditional classification accepted in this area of scheduling is based on the distinction between the learning and deterioration effects on one hand, and between the positional effects and the start-time dependent effects on the other hand. Our results show that in the framework of the introduced model such a classification is not necessary, as long as the effects are job-independent. The model introduced in this paper covers most of the previously known models. The solution algorithms are developed within the same general framework and their running times are no worse than those available earlier for problems with less general effects
Recommended from our members
Single machine scheduling with a generalized job-dependent cumulative effect
We consider a single machine scheduling problem with changing processing times. The processing conditions are subject to a general cumulative effect, in which the processing time of a job depends on the sum of certain parameters associated with previously scheduled jobs. In previous papers, these parameters are assumed to be equal to the normal processing times of jobs, which seriously limits the practical application of this model. We further generalize this model by allowing every job to respond differently to these cumulative effects. For the introduced model, we solve the problem of minimizing the makespan, with and without precedence constraints. For the problem without precedence constraints, we also consider a situation in which a maintenance activity is included in the schedule, which can improve the processing conditions of the machine, not necessarily to its original state. The resulting problem is reformulated as a variant of a Boolean programming problem with a quadratic objective, known as a half-product, which allows us to develop a fully polynomial-time approximation scheme with the best possible running time
Maintenance Strategies to Reduce Downtime Due to Machine Positional Errors
Manufacturing strives to reduce waste and increase
Overall Equipment Effectiveness (OEE). When managing machine tool maintenance a manufacturer must apply an appropriate decision technique in order to reveal hidden costs associated with production losses, reduce equipment downtime
competently and similarly identify the machines’ performance.
Total productive maintenance (TPM) is a maintenance program that involves concepts for maintaining plant and equipment effectively. OEE is a powerful metric of manufacturing performance incorporating measures of the utilisation, yield and efficiency of a given process, machine or manufacturing line. It supports TPM initiatives by accurately tracking progress towards achieving “perfect production.”
This paper presents a review of maintenance management methodologies and their application to positional error calibration decision-making. The purpose of this review is to evaluate the contribution of maintenance strategies, in particular TPM, towards improving manufacturing performance, and how they could be applied to reduce downtime due to inaccuracy of the machine. This is to find a balance between predictive
calibration, on-machine checking and lost production due to inaccuracy.
This work redefines the role of maintenance management techniques and develops a framework to support the process of implementing a predictive calibration program as a prime method to supporting the change of philosophy for machine tool calibration decision making.
Keywords—maintenance strategies, down time, OEE, TPM, decision making, predictive calibration
Recommended from our members
A review of asset management literature on multi-asset systems
This article gives an overview of the literature on asset management for multi-unit systems with an emphasis on two multi-asset categories: fleet (a system of homogeneous assets) and portfolio (a system of heterogeneous assets). As asset systems become more complicated, researchers have employed different terms to refer to their specific problems. With an
objective to facilitate readers in searching conducive studies to their interests, this paper establishes a novel classification scheme for multi-unit systems in accordance with essential features such as diversity of assets and intervention options. Moreover, discerning differences in characteristics between cross-component and cross-asset interactions, we select three types of potential multi-component dependencies (performance, stochastic, and resource) and extend their notions to be applicable to multi-asset systems. The investigation into these dependencies enables the identification of problems that could exist in real industrial settings
but are yet to be determined in academia. Ultimately, we delve into modelling approaches adopted by previous researchers. This comprehensive information allows us to offer the insights into the current trends in multi-asset maintenance. We expect that the output of this review paper will not only stress research gaps on multi-asset systems, but more importantly
help systematise future studies on this aspect
- …