Machine scheduling performance with maintenance and failure

Authors:
Y. Guo;A. Lim;B. Rodrigues;S. Yu
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY 14853, USA;Department of IELM, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;School of Business, Singapore Management University, 50 Stamford Road, 178899, Singapore;School of Computing, National University of Singapore, 3 Science Drive 2, 117543, Singapore
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2007

Citing 8
Cited 1

Multiprocessor scheduling: combining LPT and MULTIFIT

Discrete Applied Mathematics
Parallel machines scheduling with nonsimultaneous machine available time

Discrete Applied Mathematics
Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
An experimental study of LP-based approximation algorithms for scheduling problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
How to present a paper on experimental work with algorithms

ACM SIGACT News
An experimental study of online scheduling algorithms

Journal of Experimental Algorithmics (JEA)
Minimizing total flow time in single machine environment with release time: an experimental analysis

Computers and Industrial Engineering
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

The simulation-based performance measurement in an evaluation module for Faborg-Sim simulation software

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

In manufacturing control, machine scheduling research has mostly dealt with problems either without maintenance or with deterministic maintenance when no failure can occur. This can be unrealistic in practical settings. In this work, an experimental model is developed to evaluate the effect of corrective and preventive maintenance schemes on scheduling performance in the presence of machine failure where the scheduling objective is to minimize schedule duration. We show that neither scheme is clearly superior, but that the applicability of each depends on several system parameters as well as the scheduling environment itself. Further, we show that parameter values can be chosen for which preventive maintenance does better than corrective maintenance. The results provided in this study can be useful to practitioners and to system or machine administrators in manufacturing and elsewhere.