Single–machine scheduling with random machine breakdowns and randomly compressible processing times
作者:
X.D. Qi,
G. Yin,
J.R. Birge,
期刊:
Stochastic Analysis and Applications
(Taylor Available online 2000)
卷期:
Volume 18,
issue 4
页码: 635-653
ISSN:0736-2994
年代: 2000
DOI:10.1080/07362990008809689
出版商: Marcel Dekker, Inc.
关键词: Scheduling;Unreliable Machine;Random Compression
数据来源: Taylor
摘要:
This work presents a model of single–machine scheduling problem. The machine is failure–prone and subject to random breakdowns. The processing time is a deterministic sequence that is randomly compressible, which may be from the introduction of new technology or addition of new equipment. Taking into account the cost for the random breakdowns and the random compressible processing time, our objective is to find the optimal scheduling policy to minimize an objective function. Under simple conditions, it is shown that the optimal sequence possesses aV-shape property
点击下载:
PDF (533KB)
返 回