免费下载书籍地址：PDF下载地址
精美图片
Theory of scheduling 时间安排理论书籍详细信息
- ISBN：9780486428178
- 作者：暂无作者
- 出版社：暂无出版社
- 出版时间：2003-06
- 页数：304
- 价格：158.70
- 纸张：胶版纸
- 装帧：平装
- 开本：暂无开本
- 语言：未知
- 丛书：暂无丛书
- TAG：暂无
- 豆瓣评分：暂无豆瓣评分
内容简介：
prehensive text explores the mathematical models underlying the theory of scheduling. Organized according to scheduling problem type, it examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer.
Topics include problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, and further problems with one operation per job. Additional chapters cover flow-shop scheduling, the general n/m job-shop problem, general network problems related to scheduling, selection disciplines in a single-server queuing system, single-server queuing systems with setup classes, multiple-server queuing models, and experimental investigation of the continu-ous job-shop process.
An extensive bibliography is followed by helpful appendixes with information on the Laplace-Stieltjes transform of a distribution function and experimental results with the n/m job-shop problem and with the continuous-process job-shop problem.
书籍目录：
Chapter 1 Problems of Sequence
1-1 Questions of "pure" sequence
1-2 The job-shop process
1-3 A classification of scheduling problems
Chapter 2 Measures for Schedule Evaluation
2-1 Variables that define a scheduling problem
2-2 Variables that describe the solution to a scheduling problem
2-3 Performance measures for the shop
2-4 The relationship between flow-time and inventory
2-5 Costs associated with scheduling decisions
Chapter 3 Finite Sequencing for a Single Machine
3-1 Permutation schedules
3-2 Sequencing according to processing-time
3-3 Sequencing according to due-date
3-4 Random sequencing
3-5 Properties of antithetical rules
3-6 SPT sequencing with incomplete information
3-7 Sequencing against weighted measures of performance
3-8 Sequencing with multiple classes
Chapter 4 Further Problems with One Operation per Job
4-1 Sequence-dependent setup-times
4-1 1 A "branch-and-bound" algorithm for the traveling-salesman problem
4-1 2 Solution of the traveling-salesman problem by dynamic program-ming
4-1 3 The "closest-unvisited-city" algorithm for the traveling-salesman problem
4-2 Intermittent job arrivals
4-3 Required precedence among jobs
4-3.1 Required strings of jobs
4-3.2 General precedence constraints
4-4 Parallel machines
Chapter 5 Flow-Shop Scheduling
5-1 Permutation schedules
5-2 Minimizing maximum flow-time in a two-machine flow-shop
5-3 Minimizing mean flow-time in a two-machine flow-shop
5-4 The three-machine flow shop
5-5 Sequencing in large flow-shops
Chapter 6 The General n/m Job-Shop Problem
6-1 A graphical description of the problem
6-2 The two-machine job-shop problem
6-3 The two-job job-shop problem
6-4 Integer programming formulation of the job-shop problem
6-5 Types of schedules
6-6 Generation of schedules
6-7 Branch-and-bound approach to the job-shop problem
6-8 Examples of schedule generation
6-9 Probabilistic dispatching
6-10 Heuristic procedures
Chapter 7 General Network Problems Related to Scheduling
7-1 Critical route analysis
7-2 Shortest route determination
7-3 Assembly-line balancing problems
Chapter 8 Selection Disciplines in a Single-Server Queuing System
8-1 Queues with Poisson arrivals
8-2 System states
8-3 The busy period of a queue with Poisson arrivals '
8-4 The distribution of flow-time under the first-come, first-served discipline
8-5 Selection disciplines that are independent of processing-times
8-5.1 Distribution of number of jobs in the system
8-5.2 The last-come, first-served discipline
8-5.3 The random rule
8-6 Nonpreemptive priority and shortest-processing-time disciplines
8-6.1 Nonpreemptive priority disciplines
8-6.2 The shortest-processing-time discipline
8-6.3 Multiple-level nonpreemptive-priority disciplines
8-7 Preemptive priority disciplines
8-7.1 Preemptive-resume and preemptive-repeat disciplines
8-7.2 Semi-preemptive priority and shortest-remaining-processing-time disciplines
8-8 The due-date rule and related disciplines
8-9 The effect of processing-time-dependent disciplines on flow-time
8-10 Historical notes
Chapter 9 Single-Server Queuing Systems with Setup Classes
Chapter 10 Multiple-Server Queuing Models
Chapter 11 Experimental Investigation of the Continuous Job-Shop Process
Bibliography
Appendix A The Laplace-Stieltjes Transform of a Distribution Function
Appendix B Experimental Results:n/m Job-Shop Problem
Appendix C Experimental Results:Continuous-Process Job-Shop Problem
Index
作者介绍：
暂无相关内容，正在全力查找中
出版社信息：
暂无出版社相关信息，正在全力查找中！
书籍摘录：
暂无相关书籍摘录，正在全力查找中！
在线阅读/听书/购买/PDF下载地址：
在线阅读地址：Theory of scheduling 时间安排理论在线阅读
在线听书地址：Theory of scheduling 时间安排理论在线收听
在线购买地址：Theory of scheduling 时间安排理论在线购买
原文赏析：
暂无原文赏析，正在全力查找中！
其它内容：
书籍介绍
This comprehensive text explores the mathematical models underlying the theory of scheduling. Organized according to scheduling problem type, it examines 3 solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer. Topics include problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, much more. 1967 edition.
书籍真实打分
故事情节：6分
人物塑造：9分
主题深度：3分
文字风格：7分
语言运用：8分
文笔流畅：7分
思想传递：3分
知识深度：5分
知识广度：3分
实用性：3分
章节划分：4分
结构布局：3分
新颖与独特：7分
情感共鸣：5分
引人入胜：3分
现实相关：7分
沉浸感：7分
事实准确性：7分
文化贡献：4分
网站评分
书籍多样性：4分
书籍信息完全性：8分
网站更新速度：7分
使用便利性：7分
书籍清晰度：7分
书籍格式兼容性：5分
是否包含广告：9分
加载速度：6分
安全性：9分
稳定性：4分
搜索功能：8分
下载便捷性：7分
下载点评
- 全格式(102+)
- 差评(501+)
- 图书多(489+)
- 超值(423+)
- 无漏页(437+)
- 格式多(56+)
- 差评少(79+)
- 购买多(343+)
- 方便(330+)
下载评价
网友 寿***芳：可以在线转化哦
网友 谢***灵：推荐，啥格式都有
网友 寇***音：好，真的挺使用的！
网友 曹***雯：为什么许多书都找不到？
网友 师***怀：好是好，要是能免费下就好了
网友 冷***洁：不错，用着很方便
网友 石***烟：还可以吧，毕竟也是要成本的，付费应该的，更何况下载速度还挺快的
网友 龚***湄：差评，居然要收费！！！
网友 林***艳：很好，能找到很多平常找不到的书。
网友 权***颜：下载地址、格式选择、下载方式都还挺多的
网友 冯***丽：卡的不行啊
网友 后***之：强烈推荐！无论下载速度还是书籍内容都没话说 真的很良心！
网友 詹***萍：好评的，这是自己一直选择的下载书的网站
网友 宓***莉：不仅速度快，而且内容无盗版痕迹。
网友 通***蕊：五颗星、五颗星，大赞还觉得不错！~~