Machine Scheduling Problems: Classification, complexity and computations
Autor A. H. G. Rinnooy Kanen Limba Engleză Paperback – 31 iul 1976
Preț: 381.59 lei
Nou
Puncte Express: 572
Preț estimativ în valută:
73.02€ • 75.78$ • 61.04£
73.02€ • 75.78$ • 61.04£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789024718481
ISBN-10: 9024718481
Pagini: 192
Ilustrații: 190 p.
Dimensiuni: 152 x 229 x 10 mm
Greutate: 0.26 kg
Ediția:Softcover reprint of the original 1st ed. 1976
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 9024718481
Pagini: 192
Ilustrații: 190 p.
Dimensiuni: 152 x 229 x 10 mm
Greutate: 0.26 kg
Ediția:Softcover reprint of the original 1st ed. 1976
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1. Introduction.- 2. Problem Formulation.- 2.1. Notations and representations.- 2.2. Restrictive assumptions.- 2.3. Optimality criteria.- 2.4. Classification of problems.- 3. Methods of Solution.- 3.1. Complete enumeration.- 3.2. Combinatorial analysis.- 3.3. Mixed integer and non-linear programming.- 3.4. Branch-and-bound.- 3.5. Dynamic programming.- 3.6. Complexity theory.- 3.7. Heuristic methods.- 4. One-Machine Problems.- 4.1. n|1?cmax problems.- 4.2. n|1|i|Cmax problems.- 4.3. n|1??ci problems.- 4.4. n|1|?|?Ci problems.- 5. Two-Machine and Three-Machine Problems.- 5.1. The n|2|?,?|cmax and n|3|?,?|cmax problem.- 5.2. The n|2|F|?Ci problem.- 5.3. The n|2|P|Cmax problem with time lags.- 6. General Flow-Shop and Job-Shop Problems.- 6.1. The n|m|P|? problem.- 6.2. The n|m|F|? problem.- 6.3. The n|m|G|? problem.- 6.4. The n|m|?, no wait|? problem.- 7. Concluding Remarks.- 7.1. Complexity of scheduling problems.- 7.2. Practical scheduling problems.- 7.3. Conclusions.- List Of Notations.- References.- Author Index.