Muutke küpsiste eelistusi

E-raamat: Book of Open Shop Scheduling: Algorithms, Complexity and Applications

Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 135,23 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

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.

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 Mathematics, INFOR, and Algorithms and is on the editorial board of Decision-Making in Manufacturing and Services.