LEADER 04497nam 22006135 450 001 9910484890703321 005 20251113210242.0 010 $a981-15-2105-0 024 7 $a10.1007/978-981-15-2105-8 035 $a(CKB)4100000010480186 035 $a(DE-He213)978-981-15-2105-8 035 $a(MiAaPQ)EBC6121753 035 $a(PPN)242977405 035 $a(MiAaPQ)EBC6111927 035 $a(EXLCZ)994100000010480186 100 $a20200219d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDue Date-Related Scheduling with Two Agents $eModels and Algorithms /$fby Yunqiang Yin, Dujuan Wang, T.C.E. Cheng 205 $a1st ed. 2020. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2020. 215 $a1 online resource (XIII, 187 p. 12 illus.) 225 1 $aUncertainty and Operations Research,$x2195-9978 311 08$a981-15-2104-2 320 $aIncludes bibliographical references. 327 $aChapter1. Introduction to scheduling -- Chapter2. Computational complexity -- Chapter3. Scheduling problems with assignable due dates -- Chapter4. Scheduling problems with due date assignment -- Chapter5. Integrated production, inventory, and batch delivery scheduling with due date assignment -- Chapter6. Scheduling problems to maximize the weighted number of JIT jobs. 330 $aThis book provides an introduction to the models, methods, and results of some due date-related scheduling problems in the field of multiagent scheduling. In multiagent scheduling, two or more agents share a common processing resource and each agent wants to optimize its own objective function with respect to its own set of jobs. Since the agents have conflicting objective functions, they have to negotiate among themselves with regard to sharing the common resource to optimize their own objective functions. A key feature of due date-related scheduling concerns the way in which due dates are considered: they can be given parameters or decision variables. For the former case, the motivation stems from the need to improve inventory and production management. For the latter case, due date assignment becomes a challenging issue since the decision-maker has to balance inventory holding costs against the benefits of fulfifilling orders in time. As for due dates, this book addressesthe following three different scenarios: (i) The due dates of the jobs from either one or both of the two agents are decision variables, which are determined using some due date assignment models; (ii) The due dates of jobs in each job set are considered as given parameters, whereas which due date corresponds to a given job needs to determine; and (iii) The due date of each job is exogenously given. When the last case is involved, the objective function of each agent is related to the number of just-in-time jobs that are completed exactly on their due dates. For each considered scenario, depending on the model settings, and on the objective function of each agent, this book addresses the complexity, and the design of efficient exact or approximated algorithms. This book aims at introducing the author's research achievements in due date-related scheduling with two agents. It is written for researchers and Ph.D. students working in scheduling theory and othermembers of scientific community who are interested in recent scheduling models. Our goal is to enable the reader to know about some new achievements on this topic. 410 0$aUncertainty and Operations Research,$x2195-9978 606 $aGame theory 606 $aEconometrics 606 $aSociology$xMethodology 606 $aGame Theory 606 $aQuantitative Economics 606 $aSociological Methods 615 0$aGame theory. 615 0$aEconometrics. 615 0$aSociology$xMethodology. 615 14$aGame Theory. 615 24$aQuantitative Economics. 615 24$aSociological Methods. 676 $a519 700 $aYin$b Yunqiang$4aut$4http://id.loc.gov/vocabulary/relators/aut$0913758 702 $aWang$b Dujuan$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aCheng$b T.C.E$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484890703321 996 $aDue Date-Related Scheduling with Two Agents$92047250 997 $aUNINA