Linear programming performance bounds for Markov chains with polyhedrally translation invariant transition probabilities and applications to unreliable manufacturing systems and enhanced wafer fab models

James R. Morrison, P. R. Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Our focus is on a class of Markov chains which have a polyhedral translation invariance property for the transition probabilities. This class can be used to model several applications of interest which feature complexities not found in usual models of queueing networks, for example failure prone manufacturing systems which are operating under hedging point policies, or enhanced wafer fab models featuring batch tools and setups or affine index policies. We present a new family of performance bounds which is more powerful both in expressive capability as well as the quality of the bounds than some earlier approaches.

Original languageEnglish
Title of host publicationElectronic and Photonic Packaging, Electrical Systems Design and Photonics, and Nanotechnology
PublisherAmerican Society of Mechanical Engineers (ASME)
Pages69-78
Number of pages10
ISBN (Print)0791836487, 9780791836484
StatePublished - 2002

Publication series

NameASME International Mechanical Engineering Congress and Exposition, Proceedings

Keywords

  • Batch tools
  • Hedging point policies
  • Manufacturing systems
  • Performance evaluation
  • Queueing networks
  • Scheduling
  • Semiconductor manufacturing plants
  • Set-up times
  • Wafer fabs

Fingerprint

Dive into the research topics of 'Linear programming performance bounds for Markov chains with polyhedrally translation invariant transition probabilities and applications to unreliable manufacturing systems and enhanced wafer fab models'. Together they form a unique fingerprint.

Cite this