96,95 €
96,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
48 °P sammeln
96,95 €
96,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
48 °P sammeln
Als Download kaufen
96,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
48 °P sammeln
Jetzt verschenken
96,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
48 °P sammeln
  • Format: PDF

First book to examine a variety of applications and industries
Considers problems in production, distribution, and procurement scheduling
Authors are two of the most prominent researchers in the area

Produktbeschreibung
First book to examine a variety of applications and industries

Considers problems in production, distribution, and procurement scheduling

Authors are two of the most prominent researchers in the area


Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Zhi-Long Chen is Orkand Corporation Professor of Management Science at the Robert H. Smith School of Business, University of Maryland. His research interests include supply chain scheduling, logistics and transportation operations, and dynamic pricing. His main teaching interest is in operations management, supply chain management, and integer programming.

Nicholas G. Hall is Berry Professor of Operations Management at the Fisher College of Business at The Ohio State University. His research interests are in operational supply chain issues, especially scheduling and project management, and in applications of operations research to sports and public policy problems. His main teaching interest is in project management.

Rezensionen
"The book presents an impressive overview of the scheduling theory and practice applied to supply chain models (which are present everywhere!), an extensive reference is given for all the work done in scheduling over more than 60 years ... . It is detailed and presents illustrating numerical examples, it contains several algorithms and NP-hardness proofs, each chapter has a concluding part with further research ideas." (Helmut G. Kahlbacher, zbMATH 1498.90002, 2022)