Scheduling pp 267-293 | Cite as

Single Machine Models (Stochastic)

Chapter

Abstract

Stochastic models, especially with exponential processing times, may often contain more structure than their deterministic counterparts and may lead to results which, at first sight, seem surprising. Models that are NP hard in a deterministic setting often allow a simple priority policy to be optimal in a stochastic setting

Keywords

Convolution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.New York UniversityNew YorkUSA

Personalised recommendations