Author: A. M. A. HaririPublisher:
ISBN:
Category : Production scheduling
Languages : en
Pages : 21
Book Description
Single Machine Scheduling to Minimize Total Weighted Late Work
Author: A. M. A. HaririPublisher:
ISBN:
Category : Production scheduling
Languages : en
Pages : 21
Book Description
Single and Multiple Machine Scheduling to Minimize Total Weighted Late Work
Author: Robert Bryan KethleyPublisher:
ISBN:
Category :
Languages : en
Pages : 426
Book Description
Single Machine Scheduling to Minimize Weighted Earliness Subject to No Tardy Job
Author: Suresh ChandMultiagent Scheduling
Author: Alessandro AgnetisPublisher: Springer Science & Business Media
ISBN: 3642418805
Category : Business & Economics
Languages : en
Pages : 281
Book Description
Scheduling theory has received a growing interest since its origins in the second half of the 20th century. Developed initially for the study of scheduling problems with a single objective, the theory has been recently extended to problems involving multiple criteria. However, this extension has still left a gap between the classical multi-criteria approaches and some real-life problems in which not all jobs contribute to the evaluation of each criterion. In this book, we close this gap by presenting and developing multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. Several scenarios are introduced, depending on the definition and the intersection structure of the job subsets. Complexity results, approximation schemes, heuristics and exact algorithms are discussed for single-machine and parallel-machine scheduling environments. Definitions and algorithms are illustrated with the help of examples and figures.
Single Machine Scheduling to Minimize Total Late Work
Author: Luk N. Van WassenhovePublisher:
ISBN:
Category : Task analysis
Languages : en
Pages : 21
Book Description
Stochastic Local Search
Author: Holger H. HoosPublisher: Morgan Kaufmann
ISBN: 1558608729
Category : Business & Economics
Languages : en
Pages : 678
Book Description
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.
Machine Scheduling Problems
Author: A.H.G. Rinnooy KanPublisher: Springer Science & Business Media
ISBN: 1461343836
Category : Business & Economics
Languages : en
Pages : 188
Book Description
1. Introduction.- 2. Problem Formulation.- 2.1. Notations and representations.- 2.2. Restrictive assumptions.- 2.3. Optimality criteria.- 2.3.1. Regular measures.- 2.3.1.1. Criteria based on completion times.- 2.3.1.2. Criteria based on due dates.- 2.3.1.3. Criteria based on inventory cost and utilization.- 2.3.2. Relations between criteria.- 2.3.3. Analysis of scheduling costs.- 2.4. Classification of problems.- 3. Methods of Solution.- 3.1. Complete enumeration.- 3.2. Combinatorial analysis.- 3.3. Mixed integer and non-linear programming.- 3.3.1. [Bowman 1959].- 3.3.2. [Pritsker et al. 1969].
Scheduling a single machine to minimize the number of late jobs
Author: University of California, Berkeley. Computer Science DivisionPublisher:
ISBN:
Category :
Languages : en
Pages : 14
Book Description
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.
Branch and Bound Algorithms for Single Machine Scheduling with Batch Set-up Times to Minimize Total Weighted Completion Time
Author: H. A. J. CrauwelsPublisher:
ISBN:
Category : Production scheduling
Languages : en
Pages : 16
Book Description
Scheduling
Author: Michael L. PinedoPublisher: Springer Science & Business Media
ISBN: 1461423619
Category : Business & Economics
Languages : en
Pages : 673
Book Description
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)