001451871 000__ 06366cam\a2200505\a\4500
001451871 001__ 1451871
001451871 003__ OCoLC
001451871 005__ 20230310004722.0
001451871 006__ m\\\\\o\\d\\\\\\\\
001451871 007__ cr\un\nnnunnun
001451871 008__ 221225s2022\\\\sz\\\\\\ob\\\\001\0\eng\d
001451871 019__ $$a1355217456
001451871 020__ $$a9783031059216$$q(electronic bk.)
001451871 020__ $$a3031059212$$q(electronic bk.)
001451871 020__ $$z3031059204
001451871 020__ $$z9783031059209
001451871 0247_ $$a10.1007/978-3-031-05921-6$$2doi
001451871 035__ $$aSP(OCoLC)1354993690
001451871 040__ $$aYDX$$beng$$cYDX$$dGW5XE$$dEBLCP$$dOCLCQ$$dUKAHL
001451871 049__ $$aISEA
001451871 050_4 $$aTS157.5
001451871 08204 $$a658.5/3$$223/eng/20230106
001451871 1001_ $$aPinedo, Michael.
001451871 24510 $$aScheduling :$$btheory, algorithms, and systems /$$cMichael L. Pinedo.
001451871 250__ $$aSixth edition.
001451871 260__ $$aCham, Switzerland :$$bSpringer,$$c2022.
001451871 300__ $$a1 online resource
001451871 504__ $$aIncludes bibliographical references and indexes.
001451871 5050_ $$aIntro -- Preface to the Sixth Edition -- The Gantt Chart: Its Originators -- Supplementary Electronic Material -- Contents -- 1 Introduction -- 1.1 The Role of Scheduling -- 1.2 The Scheduling Function in an Enterprise -- 1.3 Outline of the Book -- Part I Deterministic Models -- 2 Deterministic Models: Preliminaries -- 2.1 Framework and Notation -- 2.2 Examples -- 2.3 Classes of Schedules -- 2.4 Complexity Hierarchy -- 3 Single Machine Models (Deterministic) -- 3.1 The Total Weighted Completion Time -- 3.2 The Maximum Lateness -- 3.3 The Number of Tardy Jobs
001451871 5058_ $$a3.4 The Total Tardiness-Dynamic Programming -- 3.5 The Total Tardiness-An Approximation Scheme -- 3.6 The Total Weighted Tardiness -- 3.7 Online Scheduling -- 3.8 Discussion -- 4 Advanced Single Machine Models (Deterministic) -- 4.1 The Total Earliness and Tardiness -- 4.2 Primary and Secondary Objectives -- 4.3 Multiple Objectives: A Parametric Analysis -- 4.4 The Makespan with Sequence Dependent Setup Times -- 4.5 Job Families with Setup Times -- 4.6 Batch Processing -- 4.7 Discussion -- 5 Parallel Machine Models (Deterministic) -- 5.1 The Makespan without Preemptions
001451871 5058_ $$a5.2 The Makespan with Preemptions -- 5.3 The Total Completion Time without Preemptions -- 5.4 The Total Completion Time with Preemptions -- 5.5 Due Date Related Objectives -- 5.6 Online Scheduling -- 5.7 Discussion -- 6 Flow Shops and Flexible Flow Shops (Deterministic) -- 6.1 Flow Shops with Unlimited Intermediate Storage -- 6.2 Flow Shops with Limited Intermediate Storage -- 6.3 Proportionate Flow Shops with Unlimited and Limited Intermediate Storage -- 6.4 Proportionate Flow Shops with Reentry -- 6.5 Flexible Flow Shops with Unlimited Intermediate Storage -- 6.6 Discussion
001451871 5058_ $$a7 Job Shops (Deterministic) -- 7.1 Disjunctive Programming and Branch and Bound -- 7.2 The Shifting Bottleneck Heuristic and the Makespan -- 7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness -- 7.4 Constraint Programming and the Makespan -- 7.5 Discussion -- 8 Open Shops (Deterministic) -- 8.1 The Makespan without Preemptions -- 8.2 The Makespan with Preemptions -- 8.3 The Maximum Lateness without Preemptions -- 8.4 The Maximum Lateness with Preemptions -- 8.5 The Number of Tardy Jobs -- 8.6 Discussion -- Part II Stochastic Models -- 9 Stochastic Models: Preliminaries
001451871 5058_ $$a9.1 Framework and Notation -- 9.2 Distributions and Classes of Distributions -- 9.3 Stochastic Dominance -- 9.4 Impact of Randomness on Fixed Schedules -- 9.5 Classes of Policies -- 10 Single Machine Models (Stochastic) -- 10.1 Arbitrary Distributions without Preemptions -- 10.2 Arbitrary Distributions with Preemptions: the Gittins Index -- 10.3 Likelihood Ratio Ordered Distributions -- 10.4 Exponential Distributions -- 10.5 Discussion -- 11 Single Machine Models with Release Dates (Stochastic) -- 11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions
001451871 506__ $$aAccess limited to authorized users.
001451871 520__ $$aThe sixth edition provides expanded Discussion and Comments and References sections at the end of each chapter, creating a spotlight on practical applications of the theory presented in that chapter. New topics include rules for stochastic parallel machine scheduling and for stochastic online scheduling, models of flow shops with reentry, fixed parameter tractability, and new designs and implementations of scheduling systems. The main structure of the book as per previous edition consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped and streamlined and the references have been made up-to-date. Theoreticians and practitioners alike will find this book of interest. Graduate students in operations management, operations research, industrial engineering, and computer science will find the book an accessible and invaluable resource. Scheduling - Theory, Algorithms, and Systems will serve as an essential reference for professionals working on scheduling problems in manufacturing, services, and other environments. Michael L. Pinedo is the Julius Schlesinger Professor of Operations Management in the Stern School of Business at New York University. Review of third edition: "This well-established text covers both the theory and practice of scheduling. The book begins with motivating examples and the penultimate chapter discusses some commercial scheduling systems and examples of their implementations." (Mathematical Reviews, 2009).
001451871 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 6, 2023).
001451871 650_0 $$aProduction scheduling.
001451871 655_0 $$aElectronic books.
001451871 77608 $$iPrint version: $$z3031059204$$z9783031059209$$w(OCoLC)1310394919
001451871 852__ $$bebk
001451871 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-05921-6$$zOnline Access$$91397441.1
001451871 909CO $$ooai:library.usi.edu:1451871$$pGLOBAL_SET
001451871 980__ $$aBIB
001451871 980__ $$aEBOOK
001451871 982__ $$aEbook
001451871 983__ $$aOnline
001451871 994__ $$a92$$bISE