Isbn: 9789024718481 - machine scheduling problems: classification, complexity and computations (11 risultati)

Condizione: New. In.

PF. Condizione: New.

Condizione: New. pp. 192 Index.

Paperback. Condizione: Brand New. reprint edition. 190 pages. 9.00x5.90x0.44 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is the result of a doctoral dissertation written under the super vision of professor dr. G. de Leve of the University of Amsterdam. I am very grateful to him for suggesting the subject and for his guidance and support during the preparation. Professor dr. ir. J. S. Folkers has carefully read various drafts of the manuscript; I would like to thank him for his many helpful comments and suggestions. I have also greatly benefited from the advice of Gene Lawler, who spent the summer of 1975 in Amsterdam at the invitation of the Stichting Mathematisch Centrum. A quick glance at the bibliography already indicates how much lowe to the extensive cooperation with Jan Karel Lenstra. Many of the results in this book are the outcome of our joint research. I am similarly grateful to Ben Lageweg, who actively participated in many projects and who was in charge of all computational experiments. The Graduate School of Management in Delft provided a stimulating professional environment. In particular I want to acknowledge the inspiring advice of David Bree and the useful contributions by Erik de Leede, Hans Geilenkirchen, Jaap Galjaard and Jan Knipscheer. I would like to thank Peter Brucker, Robbert Peters, K. Boskma, Michael Florian and Graham McMahon for their valuable written reactions. I am also grateful to Hendrik Lenstra II and Peter van Emde Boas for various illuminating conversations and to Bernard Dorhout for his kind cooperation.…

Condizione: Good. Ältere Ausgabe. Auflage: 1976. Leicht beschädigt.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is the result of a doctoral dissertation written under the super vision of professor dr. G. de Leve of the University of Amsterdam. I am very grateful to him for suggesting the subject and for his guidance and support during the preparation. Professor dr. ir. J. S. Folkers has carefully read various drafts of the manuscript; I would like to thank him for his many helpful comments and suggestions. I have also greatly benefited from the advice of Gene Lawler, who spent the summer of 1975 in Amsterdam at the invitation of the Stichting Mathematisch Centrum. A quick glance at the bibliography already indicates how much lowe to the extensive cooperation with Jan Karel Lenstra. Many of the results in this book are the outcome of our joint research. I am similarly grateful to Ben Lageweg, who actively participated in many projects and who was in charge of all computational experiments. The Graduate School of Management in Delft provided a stimulating professional environment. In particular I want to acknowledge the inspiring advice of David Bree and the useful contributions by Erik de Leede, Hans Geilenkirchen, Jaap Galjaard and Jan Knipscheer. I would like to thank Peter Brucker, Robbert Peters, K. Boskma, Michael Florian and Graham McMahon for their valuable written reactions. I am also grateful to Hendrik Lenstra II and Peter van Emde Boas for various illuminating conversations and to Bernard Dorhout for his kind cooperation. 192 pp. Englisch.…

Condizione: New. Print on Demand pp. 192 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 192.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 1. Introduction.- 2. Problem Formulation.- 2.1. Notations and representations.- 2.2. Restrictive assumptions.- 2.3. Optimality criteria.- 2.3.1. Regular measures.- 2.3.1.1. Criteria based on completion times.- 2.3.1.2. Criteria based on due dates.- 2.3.1.3.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 192 pp. Englisch. …