Macquarie Home | Course Handbook | Library | Campus Map | Macquarie Contacts
Home page

Macquarie University ResearchOnline

Home
Add
-List Of Titles -Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/146757

OpenURL Link
39 Visitors 41 Hits 0 Downloads
Title
Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information
Related
Operations research, Vol. 57, Issue 5, (2009), p.1236-1249
DOI
10.1287/opre.1080.0660
Publisher
INFORMS
Date
2009
FoR/RFCD Code(s)
080200 Computation Theory and Mathematics  010200 Applied Mathematics  150300 Business and Management
Author/Creator
Cai, Xiaoqiang
Author/Creator
Wu, Xianyi
Author/Creator
Zhou, Xian
Description
This paper considers the problem of scheduling a set of jobs on a single machine subject to stochastic breakdowns with incomplete information on the probability distributions involved in the decision process. We focus on the preemptiverepeat discipline, under which a machine breakdown leads to the loss of the work done on the job being processed. The breakdown process of the machine is allowed to depend on the job it is processing. The processing times required to complete the jobs, and the machine uptimes and downtimes, are random variables with incomplete information on their probability distributions characterized by unknown parameters. We establish the preemptive-repeat model with incomplete information and investigate its probabilistic characteristics. We show that optimal static policies can be obtained for a wide range of performance measures, which are determined by the prior distributions of the unknown parameters. We derive optimal dynamic policies via Gittins indices represented by the posterior distributions, which are updated adaptively based on processing histories. Under appropriate conditions, the optimal dynamic policies can be calculated by one-step reward rates in a closed form. As a by-product, we also show that our incomplete information model subsumes the traditional preemptive-repeat models with complete information as extreme cases.
Description
14 page(s)
Subject Keyword
080200 Computation Theory and Mathematics
Subject Keyword
010200 Applied Mathematics
Subject Keyword
150300 Business and Management
Subject Keyword
Dynamic programming/optimal control
Subject Keyword
Learning
Subject Keyword
Probability
Subject Keyword
Production/scheduling
Subject Keyword
Semi-markov
Subject Keyword
Stochastic
Subject Keyword
Stochastic model applications
Resource Type
journal article
Organisation
Macquarie University. Dept. of Applied Finance and Actuarial Studies

Identifier
http://hdl.handle.net/1959.14/146757
Identifier
ISSN:0030-364X
Identifier
mq-rm-2009005338
Language
eng
Reviewed
Reviewed
Save/E-mail Citation
Citation Format
E-mail Address
Subject
"Operations research"
 
OR
  • Show All  
  • Show My Selections 
Advanced Search

Search

Production/scheduling

Browse

  • By Title 
  • By Author/Creator 
  • By Department/Centre 
  • By Subject Keyword 
  • By Journal/Conference 
  • By FoR/RFCD codes 
  • By Resource Type 
  • By Date 

Highlights

  • Most Accessed Objects 
  • Recent Additions 
  • Pending Publications 
  • Author Profiles 

Resources

  • About ResearchOnline 
  • FAQ 
  • Open Access 
  • Open Access-FAQs 
  • Copyright 
  • Contribute 
  • Help 
  • Contact
  • Terms and Conditions 
Valid XHTML 1.0 Strict Powered by VITAL

Copyright Macquarie University | Privacy Statement | Accessibility Information

ABN 90 952 801 237 | CRICOS Provider No 00002J

Library Staff Sign In