SINGLE-MACHINE SCHEDULING PROBLEM WHEN THE MACHINE CAPACITY VARIES STOCHASTICALLY
成果类型：
Article
署名作者：
HIRAYAMA, T; KIJIMA, M
署名单位：
University of Tsukuba
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.2.376
发表日期：
1992
页码：
376-383
关键词：
摘要：
We consider single machine scheduling problems when the machine capacity varies stochastically over time. Suppose that R(t) greater-than-or-equal-to 0 processing requirements can be processed per unit of time at time t. First, we treat the general meachine capacity R(t) and then consider the machine breakdown models where R(t) = 0 or 1. Jobs may arrive according to an arbitrary process. We show that simple priority rules are optimal under some assumptions. Specifically, the c-mu rule minimizes the expected weighted total number of jobs if the processing requirements are exponentially distributed. The SEPT rule minimizes the expected total number of jobs if the processing requirements of jobs are stochastically ordered. The SERPT rule also minimizes it if the processing requirements form an ICR family.