Cantitate/Preț
Produs

A Book of Open Shop Scheduling: Algorithms, Complexity and Applications: International Series in Operations Research & Management Science, cartea 325

Autor Wieslaw Kubiak
en Limba Engleză Paperback – 5 ian 2023
This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new and recent results, and connections with graph edge coloring and mathematical programming. The book explores applications to production and operations management, wireless network scheduling, and timetabling. 
The book is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science and mathematics, who are developing and using mathematical approaches to applications in manufacturing, services and distributed wireless network scheduling.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 71215 lei  6-8 săpt.
  Springer International Publishing – 5 ian 2023 71215 lei  6-8 săpt.
Hardback (1) 71802 lei  6-8 săpt.
  Springer International Publishing – 4 ian 2022 71802 lei  6-8 săpt.

Din seria International Series in Operations Research & Management Science

Preț: 71215 lei

Preț vechi: 86848 lei
-18% Nou

Puncte Express: 1068

Preț estimativ în valută:
13627 14337$ 11312£

Carte tipărită la comandă

Livrare economică 15-29 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030910273
ISBN-10: 303091027X
Pagini: 277
Ilustrații: XIX, 277 p. 94 illus., 5 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.42 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria International Series in Operations Research & Management Science

Locul publicării:Cham, Switzerland

Cuprins

Chapter 1: Preliminaries.- Chapter 2: Makespan minimization for two-machine open shops.- Chapter 3: General open shop scheduling.- Chapter 4: Multiprocessor operations.- Chapter 5: Concurrent open shops.- Chapter 6: Open shop scheduling with simultaneity constraints.- Chapter 7: Proportionate and ordered open shops.- Chapter 8: Multiprocessor open shops.- Chapter 9: Compact scheduling of open shops.- Chapter 10: No-wait open shop scheduling.- Chapter 11: Applications of preemptive open shop scheduling.- Chapter 12: Two-machine open shop scheduling with time lags.- Index.

Notă biografică

Wieslaw Kubiak is University Research Professor at the Faculty of Business Administration, Memorial University, Newfoundland, Canada. His research focuses on co-operation and optimization in networks and supply chains, proportional fairness, just-in-time systems and scheduling theory. His professional interests include business analytics, operations strategy, intelligent optimization strategies for business and industry with multiple stakeholders and conflicting interests, and health-care engineering. 
Dr. Kubiak is also an Associate Editor for the journals Discrete Applied MathematicsINFOR, and Algorithms and is on the editorial board of Decision-Making in Manufacturing and Services.


Textul de pe ultima copertă

This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new and recent results, and connections with graph edge coloring and mathematical programming. The book explores applications to production and operations management, wireless network scheduling, and timetabling. 
The book is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science and mathematics, who are developing and using mathematical approaches to applications in manufacturing, services and distributed wireless network scheduling.

Caracteristici

Examines applications including Microprocessor open shops, Multiprocessors, renewable resource, and other Presents solutions to open problems Introduces new open problems