Download or read book Stochastic Machine Scheduling with Precedence Constraints written by Martin Skutella and published by . This book was released on 2004 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Stochastic identical parallel machine scheduling with OR precedence constraints written by Leslie R. Foulds and published by . This book was released on 1990 with total page 94 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Heuristic Procedures for Parallel Machine Scheduling written by Klaus Neumann and published by . This book was released on 1996 with total page 46 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Deterministic and Stochastic Scheduling written by M.A. Dempster and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 418 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the proceedings of an Advanced Study and Re search Institute on Theoretical Approaches to Scheduling Problems. The Institute was held in Durham, England, from July 6 to July 17, 1981. It was attended by 91 participants from fifteen different countries. The format of the Institute was somewhat unusual. The first eight of the ten available days were devoted to an Advanced Study Insti tute, with lectures on the state of the art with respect to deter ministic and stochastic scheduling models and on the interface between these two approaches. The last two days were occupied by an Advanced Research Institute, where recent results and promising directions for future research, especially in the interface area, were discussed. Altogether, 37 lectures were delivered by 24 lecturers. They have all contributed to these proceedings, the first part of which deals with the Advanced Study Institute and the second part of which covers the Advanced Research Institute. Each part is preceded by an introduction, written by the editors. While confessing to a natural bias as organizers, we believe that the Institute has been a rewarding and enjoyable event for everyone concerned. We are very grateful to all those who have contributed to its realization.
Download or read book Stochastic single machine scheduling to minimize the weighted expected flow time and maximum expected lateness subject to precedence constraints given by an OR network written by Matthias Bücker and published by . This book was released on 1989 with total page 78 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms for Deterministic and Stochastic Scheduling written by and published by Cuvillier Verlag. This book was released on 2002-03-17 with total page 182 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation Algorithms for Stochastic Scheduling on Unrelated Machines written by Jacob Healy Scott and published by . This book was released on 2008 with total page 67 pages. Available in PDF, EPUB and Kindle. Book excerpt: Motivated by problems in distributed computing, this thesis presents the first nontrivial polynomial time approximation algorithms for an important class of machine scheduling problems. We study the family of preemptive minimum makespan scheduling problems where jobs have stochastic processing requirements and provide the first approximation algorithms for these problems when machines have unrelated speeds. We show a series of algorithms that apply given increasingly general classes of precedence constraints on jobs. Letting n and m be, respectively, the number of jobs and machines in an instance, when jobs need an exponentially distributed amount of processing, we give: -- An O(log log min {m, n} )-approximation algorithm when jobs are independent; -- An 0 (log(n + m) log log min {m, n})-approximation algorithm when precedence constraints form disjoint chains; and, -- An O(log n log(n + m) log log min {m, n} )-approximation algorithm when precedence constraints form a directed forest. Very simple modifications allow our algorithms to apply to more general distributions, at the cost of slightly worse approximation ratios. Our O(log log n)-approximation algorithm for independent jobs holds when we allow restarting instead of preemption. Here jobs may switch machines, but lose all previous processing if they do so. We also consider problems in the framework of scheduling under uncertainty. This model considers jobs that require unit processing on machines with identical speeds. However, after processing a job to completion, a machine has an (unrelated) probability of failing and leaving the job uncompleted. This difficulty is offset by allowing multiple machines to process a job simultaneously. We prove that this model is equivalent to a slightly modified version of the family of problems described above and provide approximation algorithms for analogous problems with identical ratios.
Download or read book Scheduling written by Michael Pinedo and published by . This book was released on 1995 with total page 408 pages. Available in PDF, EPUB and Kindle. Book excerpt: Dealing primarily with machine scheduling models, this three-part approach covers deterministic models, stochastic models and applications in the real world.
Download or read book Stochastic Scheduling with Precedence Constraints written by Chris Pinkau and published by . This book was released on 2017 with total page 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: Researchers in management, industrial engineering, operations, and computer science have intensely studied scheduling for more than 50 years, resulting in an astounding body of knowledge in this field. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, the first handbook on scheduling, provides full coverage of the most recent and advanced topics on the subject. It assembles researchers from all relevant disciplines in order to facilitate cross-fertilization and create new scheduling insights. The book comprises six major parts, each of which breaks down into smaller chapters: · Part I introduces materials and notation, with tutorials on complexity theory and algorithms for the minimization of makespan, total completion time, dual objectives, maximum lateness, the number of late jobs, and total tardiness. · Part II is devoted to classical scheduling problems. · Part III explores scheduling models that originate in computer science, operations research, and management science. · Part IV examines scheduling problems that arise in real-time systems, focusing on meeting hard deadline constraints while maximizing machine utilization. · Part V discusses stochastic scheduling and queueing networks, highlighting jobs that are not deterministic. · Part VI covers applications, discussing scheduling problems in airline, process, and transportation industries, as well as in hospitals and educational institutions.
Download or read book Stochastic Scheduling with Variable Profile and Precedence Constraints written by Institut National de Recherche en Informatique et en Automatique and published by . This book was released on 1991 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In this paper, we consider the stochastic profile scheduling problem of a partially ordered set of tasks on uniform processors. The set of available processors varies in time. The running times of the tasks are independent random variables with exponential distributions. We obtain simple optimal preemptive policies which stochastically minimize the makespan when the partial order is an interval order, or an in-forest, or an out-forest."
Download or read book Stochastic Scheduling with Precedence Constraints written by Chris Pinkau and published by . This book was released on 2017 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Mathematical Programming The State of the Art written by A. Bachem and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 662 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the late forties, Mathematical Programming became a scientific discipline in its own right. Since then it has experienced a tremendous growth. Beginning with economic and military applications, it is now among the most important fields of applied mathematics with extensive use in engineering, natural sciences, economics, and biological sciences. The lively activity in this area is demonstrated by the fact that as early as 1949 the first "Symposium on Mathe matical Programming" took place in Chicago. Since then mathematical programmers from all over the world have gath ered at the intfrnational symposia of the Mathematical Programming Society roughly every three years to present their recent research, to exchange ideas with their colleagues and to learn about the latest developments in their own and related fields. In 1982, the XI. International Symposium on Mathematical Programming was held at the University of Bonn, W. Germany, from August 23 to 27. It was organized by the Institut fUr Okonometrie und Operations Re search of the University of Bonn in collaboration with the Sonderforschungs bereich 21 of the Deutsche Forschungsgemeinschaft. This volume constitutes part of the outgrowth of this symposium and docu ments its scientific activities. Part I of the book contains information about the symposium, welcoming addresses, lists of committees and sponsors and a brief review about the Ful kerson Prize and the Dantzig Prize which were awarded during the opening ceremony.
Download or read book Flexibility and Robustness in Scheduling written by Jean-Charles Billaut and published by John Wiley & Sons. This book was released on 2013-03-01 with total page 244 pages. Available in PDF, EPUB and Kindle. Book excerpt: Scheduling is a broad research area and scheduling problems arise from several application domains (production systems, logistic, computer science, etc.). Solving scheduling problems requires tools of combinatorial optimization, exact or approximated algorithms. Flexibility is at the frontier between predictive deterministic approaches and reactive or "on-line" approaches. The purpose of flexibility is to provide one or more solutions adapted to the context of the application in order to provide the ideal solution. This book focuses on the integration of flexibility and robustness considerations in the study of scheduling problems. After considering both flexibility and robustness, it then covers various scheduling problems, treated with an emphasis on flexibility or robustness, or both.
Download or read book Job shop scheduling with stochastic job precedence constraints written by Welf G. Schneider and published by . This book was released on 1995 with total page 60 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Job Shop Scheduling with Stochastic Precedence Constraints written by Welf G. Schneider and published by . This book was released on 1997 with total page 129 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms for single machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness written by Matthias Bücker and published by . This book was released on 1991 with total page 106 pages. Available in PDF, EPUB and Kindle. Book excerpt:
