000777738 000__ 03866cam\a2200517Mi\4500
000777738 001__ 777738
000777738 005__ 20230306142731.0
000777738 006__ m\\\\\o\\d\\\\\\\\
000777738 007__ cr\nn\nnnunnun
000777738 008__ 161018s2017\\\\gw\a\\\\ob\\\\001\0\eng\d
000777738 019__ $$a963594741
000777738 020__ $$a9783319395746
000777738 020__ $$a3319395742
000777738 020__ $$z3319395726
000777738 0247_ $$a10.1007/978-3-319-39574-6$$2doi
000777738 035__ $$aSP(OCoLC)ocn962017673
000777738 035__ $$aSP(OCoLC)962017673$$z(OCoLC)963594741
000777738 040__ $$aAZU$$beng$$epn$$cAZU$$dOCLCO$$dIDEBK$$dOCLCQ$$dOCLCF$$dUAB$$dUPM$$dIOG
000777738 049__ $$aISEA
000777738 050_4 $$aHD38.5
000777738 08204 $$a658.5/3$$223
000777738 1001_ $$aStrusevich, Vitaly A.,$$eauthor.
000777738 24510 $$aScheduling with Time-Changing Effects and Rate-Modifying Activities /$$cby Vitaly A. Strusevich, Kabir Rustogi.
000777738 264_1 $$aCham :$$bSpringer International Publishing :$$bImprint :$$bSpringer,$$c2017.
000777738 300__ $$a1 online resource (xxv, 455 pages) :$$billustrations.
000777738 336__ $$atext$$btxt$$2rdacontent
000777738 337__ $$acomputer$$bc$$2rdamedia
000777738 338__ $$aonline resource$$bcr$$2rdacarrier
000777738 347__ $$atext file$$bPDF$$2rda
000777738 4901_ $$aInternational Series in Operations Research & Management Science,$$x0884-8289 ;$$v243
000777738 504__ $$aIncludes bibliographical references and index.
000777738 5050_ $$aI Models and Methods of Classical Scheduling -- Models and Concepts of Classical Scheduling -- Pairwise Interchange Argument -- Sequencing under Precedence Constraints -- Relevant Boolean Programming Problems.
000777738 506__ $$aAccess limited to authorized users.
000777738 520__ $$aIn scheduling theory, the models that have attracted considerable attention during the last two decades allow the processing times to be variable, i.e., to be subjected to various effects that make the actual processing time of a job dependent on its location in a schedule. The impact of these effects includes, but is not limited to, deterioration and learning. Under the first type of effect, the later a job is scheduled, the longer its actual processing time becomes. In the case of learning, delaying a job will result in shorter processing times. Scheduling with Time-Changing Effects and Rate-Modifying Activities covers and advances the state-of-the-art research in this area. The book focuses on single machine and parallel machine scheduling problems to minimize either the maximum completion time or the sum of completion times of all jobs, provided that the processing times are subject to various effects. Models that describe deterioration, learning and general non-monotone effects to be considered include positional, start-time dependent, cumulative and their combinations, which cover most of the traditionally used models. The authors also consider more enhanced models in which the decision-maker may insert certain Rate-Modifying Activities (RMA) on processing machines, such as for example, maintenance or rest periods. In any case, the processing times of jobs are not only dependent on effects mentioned above but also on the place of a job in a schedule relative to an RMA. For most of the enhanced models described in the book, polynomial-time algorithms are presented which are based on similar algorithmic ideas such as reduction to linear assignment problems (in a full form or in a reduced form), discrete convexity, and controlled generation of options.
000777738 650_0 $$aBusiness.
000777738 650_0 $$aBusiness logistics.
000777738 650_0 $$aOperations research.
000777738 650_0 $$aDecision making.
000777738 650_0 $$aEngineering economy.
000777738 7001_ $$aRustogi, Kabir,$$eauthor.
000777738 77608 $$iPrint version:$$z9783319395722
000777738 830_0 $$aInternational series in operations research & management science ;$$v243.
000777738 852__ $$bebk
000777738 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-39574-6$$zOnline Access$$91397441.1
000777738 909CO $$ooai:library.usi.edu:777738$$pGLOBAL_SET
000777738 980__ $$aEBOOK
000777738 980__ $$aBIB
000777738 982__ $$aEbook
000777738 983__ $$aOnline
000777738 994__ $$a92$$bISE