Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance

We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time

Single-Machine Scheduling with Aging Effects and Optional Maintenance Activity Considerations

This paper explores a single-machine scheduling with aging effects and the problem regarding optional maintenance activity assignment. The jobs’ processing time is assumed to follow a power position-dependent aging model. The optional maintenance activity refers to the situation in which the maintenance activity can be scheduled immediately after processing of any job has been completed except for the last job and the duration of maintenance activity can be of any value from zero to a fixed time interval. A recovery function is proposed to reflect the efficiency of the machine or worker which is improved. The objective of this study is to decide whether and when to implement the maintenance activity into the job sequence, how long the duration of maintenance activity is, and how to schedule so as to minimize the makespan. Once the duration of maintenance activity is known, we introduce an efficient solution for this problem. In addition, when the maintenance activity is completely performed, we showed that the optimal policy is to schedule the maintenance activity in the middle of the task sequence and optimally solved it by lower order algorithm. Finally, we extend the problem to the case of multiple maintenance activities which are completely performed. Hence, the problem is regarded as polynomial time solvable

The Integration of Maintenance Decisions and Flow Shop Scheduling

In the conventional production and service scheduling problems, it is assumed that the machines can continuously process the jobs and the information is complete and certain. However, in practice the machines must stop for preventive or corrective maintenance, and the information available to the planners can be both incomplete and uncertain. In this dissertation, the integration of maintenance decisions and production scheduling is studied in a permutation flow shop setting. Several variations of the problem are modeled as (stochastic) mixed-integer programs. In these models, some technical nuances are considered that increase the practicality of the models: having various types of maintenance, combining maintenance activities, and the impact of maintenance on the processing times of the production jobs. The solution methodologies involve studying the solution space of the problems, genetic algorithms, stochastic optimization, multi-objective optimization, and extensive computational experiments. The application of the problems and managerial implications are demonstrated through a case study in the earthmoving operations in construction projects

Maintenance Strategies Design and Assessment Using a Periodic Complexity Approach

People become more dependent on various devices, which do deteriorate over time and their operation becomes more complex. This leads to higher unexpected failure chance, which causes inconvenience, cost, time, and even lives. Therefore, an efficient maintenance strategy that reduces complexity should be established to ensure the system performs economically as designed without interruption. In the current research, a comprehensive novel approach is developed for designing and evaluating maintenance strategies that effectively reduce complexity in a cost efficient way with maximum availability and quality. A proper maintenance strategy application needs a rigorous failure definition. A new complexity based mathematical definition of failure is introduced that is able to model all failure types. A complexity-based metric, complication rate , is introduced to measure functionality degradation and gradual failure. Maintenance reduces the system complexity by system resetting via introducing periodicity. A metric for measuring the amount of periodicity introduced by maintenance strategy is developed. Developing efficient maintenance strategies that improve system performance criteria, requires developing the mathematical relationships between maintenance and quality, availability, and cost. The first relation relating the product quality to maintenance policy is developed using the virtual age concept. The aging intensity function is then deployed to develop the relation between maintenance and availability. The relation between maintenance and cost is formulated by investigating the maintenance effect on each cost element. The final step in maintenance policy design is finding the optimum periodicity level. Two approaches are investigated; weighted sum integrated with AHP and a comfort zones approach. Comfort zones is a new developed physical programming based optimization heuristic that captures designer preferences and limitations without substantial efforts in tweaking or calculating weights. A mining truck case study is presented to explain the application of the developed maintenance design approach and compare its results to the traditional reward renewal theory. It is shown that the developed approach is more capable of designing a maintenance policy that reduces complexity and simultaneously improves some other performance measures. This research explains that considering complexity reduction in maintenance policy design improves system functionality, and it can be achieved by simple industrially applicable approach

A Multi-Skilled Approach to Property Maintenance Considering Temporal, Spatial and Resource Constraints

With the continued increase in age of the United States housing and building stock, as well as the continued need to maintain properties across the U.S., the need for timely, cost-optimal maintenance is ever more critical. This paper proposes the application of a mathematical model to aid in the scheduling and assignment of construction and maintenance tasks, considering the multi-skilled workforce. The benefit of this approach is to take advantage of the economies of scale that can be developed using cross-functional skilled workers with varying levels of competence and efficiency. This approach schedules and assigns tasks using data from maintenance task software datasets, using the least-cost, competent worker available for the job while also considering the trade-off between skilled labor cost and travel costs, both in terms of travel wage and vehicle wear and tear. The model is enhanced to include pairing between a mentor and an apprentice, where combined efficiency and pairing costs are considered at the same time as travel costs. Due to the practical nature of this research, a case organization was used and data from that firm was analyzed so that operational insights into the necessity of such a model could be considered. The mathematical backbone of the optimization approach to multi-skilled resource allocation considers the temporal and spatial demands of a geographically dispersed property management program. Actual, as opposed to sample, data allows us to evaluate the real financial implications on the case firm, if such an approach to scheduling is used. The generalization of this data provides excellent fit for a model that can be used to assign the best capable worker to the most cost-efficient task, considering deadlines, priorities and availability. Results of this scheduling approach provide significant cost and resource reductions over the historical firm performance, though practical considerations should temper that expectation. The above approach offers exceptional scalability and adaptability with the continued advancement of algorithm approaches to network-distribution and peer-to-peer work platforms