Kendall / Gendreau / Burke | Multidisciplinary Scheduling: Theory and Applications | Buch | 978-1-4419-3781-0 | sack.de

Buch, Englisch, 394 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 622 g

Kendall / Gendreau / Burke

Multidisciplinary Scheduling: Theory and Applications

1st International Conference, MISTA '03 Nottingham, UK, 13-15 August 2003. Selected Papers

Buch, Englisch, 394 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 622 g

ISBN: 978-1-4419-3781-0
Verlag: Springer US


Multidisciplinary Scheduling: Theory and Applications is a volume of nineteen reviewed papers that were selected from the sixty-seven papers presented during the First Multidisciplinary International Conference of Scheduling (MISTA). This is the initial volume of MISTA—the primary forum on interdisciplinary research on scheduling research. Each paper in the volume has been rigorously reviewed and carefully copyedited to ensure its readability.

The MISTA volume focuses on the following leading edge topics: Fundamentals of Scheduling, Multi-Criteria Scheduling, Personnel Scheduling, Scheduling in Space, Scheduling the Internet, Machine Scheduling, Bin Packing, Educational Timetabling, Sports Scheduling, and Transport Scheduling.
Kendall / Gendreau / Burke Multidisciplinary Scheduling: Theory and Applications jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Fundamentals of Scheduling.- Is Scheduling a Solved Problem?.- Formulations, Relaxations, Approximations, and Gaps in the World of Scheduling.- Order Scheduling Models: An Overview.- Multi-criteria Scheduling.- Scheduling in Software Development Using Multiobjective Evolutionary Algorithms.- Scheduling Unit Execution Time Tasks on Two Parallel Machines with the Criteria of Makespan and Total Completion Time.- Personnel Scheduling.- Task Scheduling Under Gang Constraints.- Scheduling in Space.- Constraint-Based Random Search for Solving Spacecraft Downlink Scheduling Problems.- Scheduling the Internet.- Towards an XML-Based Standard for Timetabling Problems: TTML.- A Scheduling Web Service.- Machine Scheduling.- An O(N log N) Stable Algorithm for Immediate Selections Adjustments.- An Efficient Proactive-Reactive Scheduling Approach to Hedge Against Shop Floor Disturbances.- A Dynamic Model of Tabu Search for the Job-Shop Scheduling Problem.- Bin Packing.- The Best-Fit Rule for Multibin Packing: An Extension of Graham’s List Algorithms.- Educational Timetabling.- Case-Based Initialisation of Metaheuristics for Examination Timetabling.- An Investigation of a Tabu-Search-Based Hyper-Heuristic for Examination Timetabling.- Sports Scheduling.- Round Robin Tournaments with One Bye and No Breaks in Home-Away Patterns Are Unique.- Transport Scheduling.- Rail Container Service Planning: A Constraint-Based Approach.- Rule-Based System for Platform Assignment in Bus Stations.- Measuring the Robustness of Airline Fleet Schedules.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.