Optimal Stochastic Scheduling

Business & Finance, Management & Leadership, Operations Research, Production & Operations Management
Cover of the book Optimal Stochastic Scheduling by Xiaoqiang Cai, Xian Zhou, Xianyi Wu, Springer US
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Xiaoqiang Cai, Xian Zhou, Xianyi Wu ISBN: 9781489974051
Publisher: Springer US Publication: March 20, 2014
Imprint: Springer Language: English
Author: Xiaoqiang Cai, Xian Zhou, Xianyi Wu
ISBN: 9781489974051
Publisher: Springer US
Publication: March 20, 2014
Imprint: Springer
Language: English

Many interesting and important results on stochastic scheduling problems have been developed in recent years, with the aid of probability theory. This book provides a comprehensive and unified coverage of studies in stochastic scheduling. The objective is two-fold: (i) to summarize the elementary models and results in stochastic scheduling, so as to offer an entry-level reading material for students to learn and understand the fundamentals of this area and (ii) to include in details the latest developments and research topics on stochastic scheduling, so as to provide a useful reference for researchers and practitioners in this area.

Optimal Stochastic Scheduling is organized into two parts: Chapters 1-4 cover fundamental models and results, whereas Chapters 5-10 elaborate on more advanced topics. More specifically, Chapter 1 provides the relevant basic theory of probability and then introduces the basic concepts and notation of stochastic scheduling. In Chapters 2 and 3, the authors review well-established models and scheduling policies, under regular and irregular performance measures, respectively. Chapter 4 describes models with stochastic machine breakdowns. Chapters 5 and 6 introduce, respectively, the optimal stopping problems and the multi-armed bandit processes, which are necessary for studies of more advanced subjects in subsequent chapters. Chapter 7 is focused on optimal dynamic policies, which allow adjustments of policies based on up-to-date information. Chapter 8 describes stochastic scheduling with incomplete information in the sense that the probability distributions of random variables contain unknown parameters, which can however be estimated progressively according to updated information. Chapter 9 is devoted to the situation where the processing time of a job depends on the time when it is started. Lastly, in Chapter 10 the authors look at several recent models beyond those surveyed in the previous chapters.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Many interesting and important results on stochastic scheduling problems have been developed in recent years, with the aid of probability theory. This book provides a comprehensive and unified coverage of studies in stochastic scheduling. The objective is two-fold: (i) to summarize the elementary models and results in stochastic scheduling, so as to offer an entry-level reading material for students to learn and understand the fundamentals of this area and (ii) to include in details the latest developments and research topics on stochastic scheduling, so as to provide a useful reference for researchers and practitioners in this area.

Optimal Stochastic Scheduling is organized into two parts: Chapters 1-4 cover fundamental models and results, whereas Chapters 5-10 elaborate on more advanced topics. More specifically, Chapter 1 provides the relevant basic theory of probability and then introduces the basic concepts and notation of stochastic scheduling. In Chapters 2 and 3, the authors review well-established models and scheduling policies, under regular and irregular performance measures, respectively. Chapter 4 describes models with stochastic machine breakdowns. Chapters 5 and 6 introduce, respectively, the optimal stopping problems and the multi-armed bandit processes, which are necessary for studies of more advanced subjects in subsequent chapters. Chapter 7 is focused on optimal dynamic policies, which allow adjustments of policies based on up-to-date information. Chapter 8 describes stochastic scheduling with incomplete information in the sense that the probability distributions of random variables contain unknown parameters, which can however be estimated progressively according to updated information. Chapter 9 is devoted to the situation where the processing time of a job depends on the time when it is started. Lastly, in Chapter 10 the authors look at several recent models beyond those surveyed in the previous chapters.

More books from Springer US

Cover of the book ATP and the Heart by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book The Retinal Müller Cell by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Papillomaviruses in Human Cancer by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Contemporary Theories and Systems in Psychology by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book High-Speed Clock Network Design by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Haemophilus, Actinobacillus, and Pasteurella by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Claim, Intent, and Persuasion by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book The Cognitive Foundations of Personality Traits by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Homeostasis, Nephrotoxicity, and Renal Anomalies in the Newborn by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Understanding Complexity by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Semiconductor Optical Modulators by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Winning Airlines by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Cervix Cancer by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Juveniles’ Waiver of Rights by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
Cover of the book Resistance by Xiaoqiang Cai, Xian Zhou, Xianyi Wu
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy