Atjaunināt sīkdatņu piekrišanu

Scheduling in Computer and Manufacturing Systems 2nd ed. 1994. Softcover reprint of the original 2nd ed. 1994 [Mīkstie vāki]

4.00/5 (3 ratings by Goodreads)
, , ,
  • Formāts: Paperback / softback, 312 pages, height x width: 244x170 mm, weight: 568 g, X, 312 p., 1 Paperback / softback
  • Izdošanas datums: 13-Dec-2011
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642790364
  • ISBN-13: 9783642790362
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 91,53 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 107,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Scheduling in Computer and Manufacturing Systems 2nd ed. 1994. Softcover reprint of the original 2nd ed. 1994Palielināt
  • Formāts: Paperback / softback, 312 pages, height x width: 244x170 mm, weight: 568 g, X, 312 p., 1 Paperback / softback
  • Izdošanas datums: 13-Dec-2011
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642790364
  • ISBN-13: 9783642790362
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783642790362.html
Keywords:
Let us start with the description of the purpose of this book. First we should explain how we understand its tide. In general, scheduling problems can be understood very broadly as the problems of the allocation of resources over time to perform a set of tasks. By resources we understand arbitrary means tasks compete for. They can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools. Also tasks can have a variety of interpretations starting from machining parts in manu­ facturing systems up to processing information in computer systems. The same is true for task characteristics, e. g. ready times, due dates, relative urgency weights, functions describing task processing in relation to allotted resources. Moreover, a structure of a set of tasks, reflecting precedence constraints among them, can be defined in different ways. In addition, different criteria which measure the quality of the performance of a set of tasks can be taken into account.

Papildus informācija

Springer Book Archives
1 Introduction
1(5)
References
4(2)
2 Preliminaries
6(31)
2.1 Sets and Relations
6(2)
2.2 Problems, Algorithms, Complexity
8(8)
2.2.1 Problems and their Encoding
8(2)
2.2.2 Algorithms
10(2)
2.2.3 Complexity
12(4)
2.3 Graphs and Networks
16(10)
2.3.1 Basic Notions
16(1)
2.3.2 Special Classes of Digraphs
17(3)
2.3.3 Networks
20(6)
2.4 Enumerative Methods
26(3)
2.4.1 Dynamic Programming
27(1)
2.4.2 Branch and Bound
27(2)
2.5 Heuristic and Approximation Algorithms
29(8)
References
34(3)
3 Formulation of Scheduling Problems
37(14)
3.1 Definition of Scheduling Problems
37(4)
3.2 Analysis of Scheduling Problems and Algorithms
41(3)
3.3 Motivations for Deterministic Scheduling Problems
44(2)
3.4 Classification of Deterministic Scheduling Problems
46(5)
References
49(2)
4 Single Processor Scheduling
51(61)
4.1 Minimizing Schedule Length
51(9)
4.1.1 Scheduling with Release Times and Deadlines
52(6)
4.1.2 Scheduling with Release Times and Delivery Times
58(2)
4.2 Minimizing Mean Weighted Flow Time
60(13)
4.3 Minimizing Due Date Involving Criteria
73(17)
4.3.1 Maximum Lateness
73(8)
4.3.2 Number of Tardy Tasks
81(5)
4.3.3 Tardiness Problems
86(3)
4.3.4 Earliness and Lateness Problems
89(1)
4.4 Minimizing Change-Over Cost
90(8)
4.4.1 Setup Scheduling
90(3)
4.4.2 Lot Size Scheduling
93(5)
4.5 Other Criteria
98(14)
4.5.1 Minimizing Maximum Cost
98(5)
4.5.2 Minimizing Mean Cost
103(2)
References
105(7)
5 Parallel Processor Scheduling
112(59)
5.1 Minimizing Schedule Length
112(26)
5.1.1 Identical Processors
112(17)
5.1.2 Uniform and Unrelated Processors
129(9)
5.2 Minimizing Mean Flow Time
138(4)
5.2.1 Identical Processors
138(1)
5.2.2 Uniform and Unrelated Processors
139(3)
5.3 Minimizing Due Date Involving Criteria
142(8)
5.3.1 Identical Processors
142(5)
5.3.2 Uniform and Unrelated Processors
147(3)
5.4 Other Models
150(21)
5.4.1 Semi-Identical Processors
151(9)
5.4.2 Scheduling Multiprocessor Tasks
160(4)
References
164(7)
6 Static Shop Scheduling
171(21)
6.1 Flow Shop Scheduling
171(6)
6.2 Open Shop Scheduling
177(1)
6.3 Job Shop Scheduling
178(14)
6.3.1 Basic Ideas
178(3)
6.3.2 Branch and Bound Algorithm
181(3)
6.3.3 Simulated Annealing
184(2)
6.3.4 Computational Results
186(3)
References
189(3)
7 Resource Constrained Scheduling
192(43)
7.1 Classical Model
192(9)
7.2 Scheduling Multiprocessor Tasks
201(14)
7.3 Scheduling with Continuous Resources
215(20)
7.3.1 Introductory Remarks
215(1)
7.3.2 Processing Speed vs. Resource Amount Model
216(7)
7.3.3 Processing Time vs. Resource Amount Model
223(5)
7.3.4 Ready Time vs. Resource Amount Model
228(4)
References
232(3)
8 Scheduling in Flexible Manufacturing Systems
235(29)
8.1 Introductory Remarks
235(2)
8.2 Scheduling Flexible Flow Shops
237(8)
8.2.1 Problem Formulation
237(1)
8.2.2 Heuristics and their Performance
238(2)
8.2.3 Branch and Bound Algorithm
240(5)
8.3 Scheduling Dynamic Job Shops
245(8)
8.3.1 Introductory Remarks
245(1)
8.3.2 Heuristic Algorithm for the Static Problem
246(5)
8.3.3 Computational Experiments
251(2)
8.4 Simultaneous Scheduling and Routing in some FMS
253(11)
8.4.1 Problem Formulation
253(2)
8.4.2 Vehicle Scheduling for a Fixed Production Schedule
255(4)
8.4.3 Simultaneous Job and Vehicle Scheduling
259(1)
References
260(4)
9 From Theory to Practice
264(34)
9.1 Scheduling in Computer Integrated Manufacturing
265(4)
9.2 Solution Approaches Based on Artificial Intelligence
269(20)
9.2.1 Interactive Scheduling
272(12)
9.2.2 Knowledge-Based Systems
284(5)
9.3 Integration of Knowledge and Algorithms
289(9)
9.3.1 Intelligent Production Scheduling
289(3)
9.3.2 Integrated Problem Solving
292(4)
References
296(2)
Index 298