Download or read book Minimizing the Maximum Earliness Tardiness on a Single Machine with Generalized Due Dates written by Daniel Oron and published by . This book was released on 2019 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This paper considers a single machine scheduling problem with generalized due-dates (GDD) to minimize the maximum earliness and tardiness. Under the assumption of GDD, due-dates are not job-dependent but rather associated with the number of jobs previously processed. First, we prove that the problem is strongly NP-hard by reduction to the well-known 3-partition problem. We then formulate three lower-bounds on the optimal solution, and develop an efficient heuristic for the problem. The heuristic is shown to perform very well through an extensive numerical study.

Download or read book minimizing mean tardiness and earliness in single machine scheduling problems with unequal due dates written by yeong dae kim, candace arai yano and published by . This book was released on 1992 with total page 34 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book ALGORITHMS FOR SINGLE MACHINE SCHEDULING PROBLEMS MINIMIZING TARDINESS AND EARLINESS written by Candace A. Yano, Yeong-Dae Kim and published by . This book was released on 1986 with total page 26 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Handbook of Scheduling written by Joseph Y-T. Leung and published by CRC Press. This book was released on 2004-04-27 with total page 1215 pages. Available in PDF, EPUB and Kindle. Book excerpt: This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.

Download or read book Due Date Related Scheduling with Two Agents written by Yunqiang Yin and published by Springer Nature. This book was released on 2020-02-19 with total page 198 pages. Available in PDF, EPUB and Kindle. Book excerpt: This 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 addresses the 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 other members 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.

Download or read book Earliness Tardiness Scheduling Problems II written by Nicholas G. Hall and published by . This book was released on 2017 with total page 10 pages. Available in PDF, EPUB and Kindle. Book excerpt: A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of jobs, allowing the possibility that d is early enough to constrain the scheduling decision. We describe several optimality conditions. The recognition version of the problem is shown to be NP-complete in the ordinary sense, confirming a well known conjecture. Moreover, this complexity definition is precise, since we describe a dynamic programming algorithm which runs in pseudopolynomial time. This algorithm is also extremely efficient computationally, providing an improvement over earlier procedures, of almost two orders of magnitude in the size of instance that can be solved. Finally, we describe a special case of the problem which is polynomially solvable.

Download or read book Scheduling written by Michael L. Pinedo and published by Springer Science & Business Media. This book was released on 2012-01-07 with total page 673 pages. Available in PDF, EPUB and Kindle. Book excerpt: This new edition of the well established text Scheduling - Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as significant scheduling problems that occur in the real world. It again includes supplementary material in the form of slide-shows from industry and movies that show 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. The references have been made completely 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. Reviews 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)

Download or read book Stochastic Local Search written by Holger H. Hoos and published by Morgan Kaufmann. This book was released on 2005 with total page 678 pages. Available in PDF, EPUB and Kindle. Book excerpt: Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a systematic treatment of SLS algorithms, this book examines the general concepts and specific instances of SLS algorithms and considers their development, analysis and application.

Download or read book Single Machine Scheduling to Minimize Weighted Earliness Subject to No Tardy Job written by Suresh Chand and published by . This book was released on 1985 with total page 44 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Combinatorial Optimization and Applications written by Andreas Dress and published by Springer Science & Business Media. This book was released on 2007-07-25 with total page 399 pages. Available in PDF, EPUB and Kindle. Book excerpt: Running to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature. It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions and cover both theoretical issues and practical applications.

Download or read book A Hybrid Genetic Algorithm to Minimize the Earliness and Tardiness Penalties for a Single machine Scheduling Problem with a Common Due Date and Sequence dependent Setup Times written by Pradeep Ramamurthy Durbhakula and published by . This book was released on 2004 with total page 228 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Supply Chain Scheduling written by Zhi-Long Chen and published by Springer Nature. This book was released on 2022-02-07 with total page 699 pages. Available in PDF, EPUB and Kindle. Book excerpt: Supply chain scheduling is a relatively new research area with less than 20 years of history. It is an intersection of two traditional areas: supply chain management and scheduling. In this book, the authors provide a comprehensive coverage of supply chain scheduling. The book covers applications, solution algorithms for solving related problems, evaluation of supply chain conflicts, and models for encouraging cooperation between decision makers. Supply chain scheduling studies detailed scheduling issues within supply chains, as motivated by a variety of applications in the real world. Topics covered by the book include: Coordinated decision making in centralized supply chains, including integrated production and distribution scheduling, joint scheduling and product pricing, and coordinated subcontracting and scheduling. Coordination and competition issues in decentralized supply chains, including conflict and cooperation within scheduling decisions made by different parties in supply chains, and both cooperative and non-cooperative supply chain scheduling games. The book describes a variety of representative problems within each of these topics. The authors define these problems mathematically, describe corresponding applications, and introduce solution methods for solving each problem to improve supply chain performance.

Download or read book Algorithms for Single Machine Scheduling Problems Minimizing Tardiness and Earliness written by Candace A. Yano and published by . This book was released on 1986 with total page 34 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Time Dependent Scheduling written by Stanislaw Gawiejnowicz and published by Springer Science & Business Media. This book was released on 2008-09-26 with total page 379 pages. Available in PDF, EPUB and Kindle. Book excerpt: Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, and time-dependent scheduling with two criteria. The reader should be familiar with basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, and he completes the book with an extensive bibliography, and author, symbol and subject indexes. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.

Download or read book Principles of Sequencing and Scheduling written by Kenneth R. Baker and published by John Wiley & Sons. This book was released on 2013-06-05 with total page 407 pages. Available in PDF, EPUB and Kindle. Book excerpt: An up-to-date and comprehensive treatment of the fundamentals of scheduling theory, including recent advances and state-of-the-art topics Principles of Sequencing and Scheduling strikes a unique balance between theory and practice, providing an accessible introduction to the concepts, methods, and results of scheduling theory and its core topics. With real-world examples and up-to-date modeling techniques, the book equips readers with the basic knowledge needed for understanding scheduling theory and delving into its applications. The authors begin with an introduction and overview of sequencing and scheduling, including single-machine sequencing, optimization and heuristic solution methods, and models with earliness and tardiness penalties. The most current material on stochastic scheduling, including correct scheduling of safety time and the use of simulation for optimization, is then presented and integrated with deterministic models. Additional topical coverage includes: Extensions of the basic model Parallel-machine models Flow shop scheduling Scheduling groups of jobs The job shop problem Simulation models for the dynamic job shop Network methods for project scheduling Resource-constrained project scheduling Stochastic and safe scheduling Extensive end-of-chapter exercises are provided, some of which are spreadsheet-oriented, and link scheduling theory to the most popular analytic platform among today's students and practitioners—the Microsoft Office Excel® spreadsheet. Extensive references direct readers to additional literature, and the book's related Web site houses material that reinforces the book's concepts, including research notes, data sets, and examples from the text. Principles of Sequencing and Scheduling is an excellent book for courses on sequencing and scheduling at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners in the fields of statistics, computer science, operations research, and engineering.

Download or read book algorithms for a class of single machine weighted tardiness and earliness problems written by candace arai yano, yeong-dae kim and published by . This book was released on 1989 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Scheduling a single machine to minimize the number of late jobs written by University of California, Berkeley. Computer Science Division and published by . This book was released on 1983 with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: Suppose n jobs, each with a specified release date, due date and processing time, are to be scheduled for processing by a single machine, with the objective of minimizing the number of jobs that are not completed by their due dates. Three results, in the form of two algorithms and one NP-completeness proof, are presented. Our first result is to show that if release dates and due dates are "compatible," i. e. similarly ordered, an optimal schedule can be found in O(n log n) time by a procedure that is a natural generalization of that of Moore for the case in which all release dates are equal. This result improves on an O(n squared) solution to this problem by Kise, Ibaraki and Mine. For our Second result, no particular relationship is assumed between the release dates and the due dates and the schedule is allowed to be preemptive. We show that a schedule minimizing the weighted number of late jobs can be found in O(n cubed W cubed) time where W is the sum of the integer weights assigned to the jobs. If the jobs are unweighted, then in effect W=n and the time bound reduces to O(n to the 6), thereby yielding a polynomial-bounded algorithm for a problem for which no such solution procedure was previously known. For our third result, we suppose that all release dates are equal and that each job has a deadline in addition to its due date. We show that it is an NP-hard problem to minimize the number of late jobs (with respect to due dates) while observing all deadlines. This result resolves an open question suggested by a result of J. Sidney.