001443447 000__ 03455cam\a2200541Ii\4500
001443447 001__ 1443447
001443447 003__ OCoLC
001443447 005__ 20230310003545.0
001443447 006__ m\\\\\o\\d\\\\\\\\
001443447 007__ cr\un\nnnunnun
001443447 008__ 220105s2022\\\\sz\a\\\\ob\\\\001\0\eng\d
001443447 019__ $$a1291147316$$a1291171062$$a1291316357$$a1294353851
001443447 020__ $$a9783030910259$$q(electronic bk.)
001443447 020__ $$a3030910253$$q(electronic bk.)
001443447 020__ $$z9783030910242
001443447 020__ $$z3030910245
001443447 0247_ $$a10.1007/978-3-030-91025-9$$2doi
001443447 035__ $$aSP(OCoLC)1290840988
001443447 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCO$$dDCT$$dOCLCF$$dOCLCO$$dUKAHL$$dN$T$$dOCLCQ
001443447 049__ $$aISEA
001443447 050_4 $$aTS157.5$$b.K83 2022
001443447 08204 $$a658.5/3$$223
001443447 1001_ $$aKubiak, Wieslaw,$$eauthor.
001443447 24512 $$aA book of open shop scheduling :$$balgorithms, complexity and applications /$$cWieslaw Kubiak.
001443447 264_1 $$aCham :$$bSpringer,$$c[2022]
001443447 264_4 $$c©2022
001443447 300__ $$a1 online resource :$$billustrations (some color).
001443447 336__ $$atext$$btxt$$2rdacontent
001443447 337__ $$acomputer$$bc$$2rdamedia
001443447 338__ $$aonline resource$$bcr$$2rdacarrier
001443447 347__ $$atext file$$bPDF$$2rda
001443447 4901_ $$aInternational series in operations research and management science ;$$vvolume 325
001443447 504__ $$aIncludes bibliographical references and index.
001443447 5050_ $$aChapter 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.
001443447 506__ $$aAccess limited to authorized users.
001443447 520__ $$aThis 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.
001443447 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 13, 2022).
001443447 650_0 $$aProduction scheduling$$xMathematical models.
001443447 650_6 $$aOrdonnancement (Gestion)$$xModèles mathématiques.
001443447 655_0 $$aElectronic books.
001443447 77608 $$iPrint version:$$z3030910245$$z9783030910242$$w(OCoLC)1274199900
001443447 830_0 $$aInternational series in operations research & management science ;$$v325.
001443447 852__ $$bebk
001443447 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-91025-9$$zOnline Access$$91397441.1
001443447 909CO $$ooai:library.usi.edu:1443447$$pGLOBAL_SET
001443447 980__ $$aBIB
001443447 980__ $$aEBOOK
001443447 982__ $$aEbook
001443447 983__ $$aOnline
001443447 994__ $$a92$$bISE