LEADER 03710nam 2200697 a 450 001 9910438081403321 005 20200520144314.0 010 $a1-283-62474-5 010 $a9786613937193 010 $a1-4614-5152-3 024 7 $a10.1007/978-1-4614-5152-5 035 $a(CKB)2670000000246561 035 $a(EBL)1030703 035 $a(OCoLC)811059041 035 $a(SSID)ssj0000767026 035 $a(PQKBManifestationID)11511281 035 $a(PQKBTitleCode)TC0000767026 035 $a(PQKBWorkID)10731664 035 $a(PQKB)11709651 035 $a(DE-He213)978-1-4614-5152-5 035 $a(MiAaPQ)EBC1030703 035 $a(PPN)168302187 035 $a(EXLCZ)992670000000246561 100 $a20120820d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aFlow shop scheduling $etheoretical results, algorithms, and applications /$fHamilton Emmons, George Vairaktarakis 205 $a1st ed. 2013. 210 $aNew York $cSpringer$d2013 215 $a1 online resource (345 p.) 225 1 $aInternational series in operations research & management science,$x0884-8289 ;$vv. 182 300 $aDescription based upon print version of record. 311 $a1-4899-8853-X 311 $a1-4614-5151-5 320 $aIncludes bibliographical references and index. 327 $aIntroduction -- The Two-Machine Flow Shop -- Transfer Lags in the Flow Shop -- The m-Machine Flow Shop -- The Machine Flow Shop -- The Hybrid Flow Shop -- The No-Wait Flow Shop -- Blocking or Limited Buffers in Flow Shops -- Flexible Flow Shops -- Reentrant Flow Shops -- The Robust Flow Shops -- Stochastic Flow Shops -- The Complexity of Problems. 330 $aAlthough several monographs and edited volumes have discussed scheduling in general, most of these works survey the field by contributing a single chapter to production systems like flow shops. Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications is solely dedicated to bringing together a huge body of knowledge on the subject, along distinct design features, in order to help scholars and practitioners easily identify problems of interest. This monograph has been organized into ten distinct flow shop systems and explores their connections. The chapters cover flow shop systems including two-machine, flexible, stochastic, and more. Outside of the traditional flow shops that require a job never revisits any stage, this book also examines the reentrant flow shop, in which a job may cycle back and be reprocessed at the same station or sequence of stations, multiple times. The authors have made the material accessible to a broad readership, using simplified notation and revealing unifying concepts. The results unique to flow shop research should provide the seed for research in other areas of scheduling and in optimization in general. 410 0$aInternational series in operations research & management science ;$v182. 606 $aProduction scheduling 606 $aProduction control 606 $aProduction control$xMathematical models 606 $aManufacturing processes 606 $aProduction planning 615 0$aProduction scheduling. 615 0$aProduction control. 615 0$aProduction control$xMathematical models. 615 0$aManufacturing processes. 615 0$aProduction planning. 676 $a658.53 700 $aEmmons$b Hamilton$01058236 701 $aVairaktarakis$b George$01749947 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910438081403321 996 $aFlow shop scheduling$94184408 997 $aUNINA