Scheduling deteriorating jobs on a single machine subject to breakdowns
We investigate the problem of scheduling a set of jobs to minimize the expected makespan or the variance of the makespan. The jobs are subject to deteriorations which are expressed as linear increments of the processing requirements. The machine is subject to preemptive-resume breakdowns with exponentially distributed uptimes and downtimes. It has been well known in the classical models that the expectation and variance of the makespan of deteriorating jobs can be minimized analytically by an index policy if no machine breakdowns are involved. Such basic features, however, change dramatically when breakdowns and deteriorations are present together. In this paper, we derive conditions for jobs to be processible in the sense that they will be eventually completed, and the characteristics of the time that a job occupies the machine. We further find that the expected makespan can still be minimized by a simple index policy that is independent of the breakdown process, but this is no longer the case for the variance of the makespan.
KeywordsStochastic scheduling Machine breakdowns Preemptive-resume Deteriorations Processibility of job
Unable to display preview. Download preview PDF.
- Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50, 711–720. Google Scholar
- Cai, X., Wu, X., & Zhou, X. (2009). Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information. Operations Research. Published online before print, doi: 10.1287/opre.1080.0660.
- Pinedo, M. (2002). Scheduling: theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall. Google Scholar