LEADER 04383nam 22006015 450 001 9910136021703321 005 20200630184928.0 010 $a3-319-39574-2 024 7 $a10.1007/978-3-319-39574-6 035 $a(CKB)3710000000909075 035 $a(DE-He213)978-3-319-39574-6 035 $a(MiAaPQ)EBC4720725 035 $a(PPN)222233206 035 $a(EXLCZ)993710000000909075 100 $a20161018d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aScheduling with Time-Changing Effects and Rate-Modifying Activities /$fby Vitaly A. Strusevich, Kabir Rustogi 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XXV, 455 p. 14 illus.) 225 1 $aInternational Series in Operations Research & Management Science,$x0884-8289 ;$v243 300 $aIncludes index. 311 $a3-319-39572-6 327 $aI Models and Methods of Classical Scheduling -- Models and Concepts of Classical Scheduling -- Pairwise Interchange Argument -- Sequencing under Precedence Constraints -- Relevant Boolean Programming Problems. 330 $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. 410 0$aInternational Series in Operations Research & Management Science,$x0884-8289 ;$v243 606 $aBusiness logistics 606 $aOperations research 606 $aDecision making 606 $aEngineering economy 606 $aEngineering economy 606 $aLogistics$3https://scigraph.springernature.com/ontologies/product-market-codes/519020 606 $aOperations Research/Decision Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/521000 606 $aEngineering Economics, Organization, Logistics, Marketing$3https://scigraph.springernature.com/ontologies/product-market-codes/T22016 615 0$aBusiness logistics. 615 0$aOperations research. 615 0$aDecision making. 615 0$aEngineering economy. 615 0$aEngineering economy. 615 14$aLogistics. 615 24$aOperations Research/Decision Theory. 615 24$aEngineering Economics, Organization, Logistics, Marketing. 676 $a658.5 700 $aStrusevich$b Vitaly A$4aut$4http://id.loc.gov/vocabulary/relators/aut$0881862 702 $aRustogi$b Kabir$4aut$4http://id.loc.gov/vocabulary/relators/aut 906 $aBOOK 912 $a9910136021703321 996 $aScheduling with Time-Changing Effects and Rate-Modifying Activities$91969861 997 $aUNINA