Scheduling deteriorating jobs on a single machine subject to breakdowns

Authors:
Xiaoqiang Cai;Xianyi Wu;Xian Zhou
Affiliations:
Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Pok Fu Lam, Hong Kong;Department of Statistics and Actuarial Science, and Center of International Finance and Risk Management, East China Normal University, Shanghai, China;Department of Actuarial Studies, Macquarie University, Sydney, Australia
Venue:
Journal of Scheduling
Year:
2011

Citing 6
Cited 3

Scheduling deteriorating jobs on a single processor

Operations Research
Stochastic single machine scheduling with quadratic early-tardy penalties

Operations Research
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs

Operations Research
STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME

Probability in the Engineering and Informational Sciences
Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

Operations Research

A two-stage hybrid flowshop scheduling problem in machine breakdown condition

Journal of Intelligent Manufacturing
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research
Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.