Download or read book Approximation Algorithms for Scheduling to Minimize the Makespan of Communicating Processes on Selected Computer Networks written by Maxwell Sutherland Drew and published by . This book was released on 1980 with total page 374 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling Computer and Manufacturing Processes written by Jacek Blazewicz and published by Springer Science & Business Media. This book was released on 2013-04-17 with total page 493 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is a continuation of Scheduling in Computer and Manufacturing Sys tems 1, two editions of which have received kind acceptance of a wide readership. As the previous position, it is the result of a collaborative German-Polish project which has been partially supported by Committee for Scientific Research 2 and DFG. We appreciate this help. We decided to treat this work as a new book rather than the third edition of the previous one due to two important reasons. First of all, the contents has been changed significantly. This concerns not only corrections we have introduced following the suggestions made by many readers (we are very grateful to all of them!) and taking into account our own experience, but first of all this means that important new material has been added. In particular, in the introductory part the ideas of new local search heuristics, i. e. generally applicable global optimization strategies with a simple capability of learning (ejection chains, genetic algo rithms) have been presented. In the framework of parallel processor scheduling, topics of imprecise computations and lot size scheduling have been studied. Further on flow shop and job shop scheduling problems have been studied much more extensively, both from the viewpoint of exact algorithms as well as heuris tics.
Download or read book Scientific and Technical Aerospace Reports written by and published by . This book was released on 1987 with total page 1126 pages. Available in PDF, EPUB and Kindle. Book excerpt: Lists citations with abstracts for aerospace related reports obtained from world wide sources and announces documents that have recently been entered into the NASA Scientific and Technical Information Database.
Download or read book Proceedings of the Fifth International Conference on Genetic Algorithms written by United States. Office of Naval Research and published by Morgan Kaufmann. This book was released on 1993 with total page 690 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book American Doctoral Dissertations written by and published by . This book was released on 1980 with total page 604 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation Algorithms for Scheduling and Fair Allocations written by Yihao Zhang and published by . This book was released on 2022 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, we will have discussions on two main topics, max-min allocation and schedulingjobs with precedent constraints on machines with communication delays. New approximation algorithms are given in Chapter 2, 4 and 5, where linear programming plays a fairly important role on algorithm designs, while Chapter 3 contains partial results on the general max-min allocation. The Santa Claus problem is also known as the restricted max-min fair allocation. In this problem, Santa Claus has a set of gifts, and he wants to distribute them among a set of children so that the least happy child is made as happy as possible. Here, the value that a child i has for a present j is of the form pij [is an element of] {0, pj}. Based on a modification of Haxell's hypergraph matching argument, a polynomial time algorithm by Annamalai et al. gives a 12.33-approximation. In joint work with Sami Davies and Thomas Rothvoss, a matroid version of the Santa Claus problem is introduced. The algorithm is based on Haxell's augmenting tree, but with the introduction of the matroid structure. Our result can then be used as a blackbox to obtain a (4 + [epsilon])-approximation for Santa Claus, comparing against a natural, compact LP. A recent work of Cheng and Mao [CM19] also gets the factor (4 + [epsilon]). On the second half, we first consider the classic problem of scheduling jobs with precedence constraints on identical machines to minimize makespan, in the presence of communication delays. In this setting, denoted by P | prec, c | Cmax, if two dependent jobs are scheduled on different machines, then at least c units of time must pass between their executions. Despite its relevance to many applications, the best known approximation ratio was O(c), whereas Graham's greedy list scheduling algorithm already gives a (c + 1)-approximation in that setting. An outstanding open problem in the top-10 list by Schuurman and Woeginger and its recent update by Bansal asks whether there exists a constant-factor approximation algorithm. In joint work with Sami Davies, Janardhan Kulkarni, Thomas Rothvoss and Jakub Tarnawski, we give a polynomial-time O(log c · log m)-approximation algorithm for this problem, where m is the number of machines and c is the communication delay. Our approach is based on a Sherali-Adams lift of a linear programming relaxation and a randomized clustering of the semimetric space induced by this lift. Finally, a more general version of this problem is considered in Chapter 5, to minimize the weighted sum of completion times on related machines, denoted by Q | prec, c | wjCj . Our main result is an O(log4 n)-approximation algorithm for the problem. As a byproduct of our result, we also obtain an O(log3 n)-approximation algorithm for the problem of minimizing makespan Q | prec, c | Cmax, which improves upon the O(log5 n/ log log n)-approximation algorithm due to a recent work of Maiti et al. [MRS+20].
Download or read book Approximation Algorithms for Scheduling Problems written by Chandra Chekuri and published by . This book was released on 1998 with total page 133 pages. Available in PDF, EPUB and Kindle. Book excerpt: 2. Minimizing makespan on machines with different speeds when jobs have precedence constraints. We obtain an O(log m) approximation (m is the number of machines) in O(n[superscript]3) time.
Download or read book Comprehensive Dissertation Index written by and published by . This book was released on 1984 with total page 890 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Distributed Data Bases written by Hans-Jochen Schneider and published by North Holland. This book was released on 1982 with total page 386 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms and Computation written by Xiaotie Deng and published by Springer Science & Business Media. This book was released on 2005-12-09 with total page 1209 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in Sanya, Hainan, China in December 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms.
Download or read book Dissertation Abstracts International written by and published by . This book was released on 2007 with total page 924 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Scheduling for Parallel Processing written by Maciej Drozdowski and published by Springer Science & Business Media. This book was released on 2010-03-14 with total page 395 pages. Available in PDF, EPUB and Kindle. Book excerpt: Overview and Goals This book is dedicated to scheduling for parallel processing. Presenting a research ?eld as broad as this one poses considerable dif?culties. Scheduling for parallel computing is an interdisciplinary subject joining many ?elds of science and te- nology. Thus, to understand the scheduling problems and the methods of solving them it is necessary to know the limitations in related areas. Another dif?culty is that the subject of scheduling parallel computations is immense. Even simple search in bibliographical databases reveals thousands of publications on this topic. The - versity in understanding scheduling problems is so great that it seems impossible to juxtapose them in one scheduling taxonomy. Therefore, most of the papers on scheduling for parallel processing refer to one scheduling problem resulting from one way of perceiving the reality. Only a few publications attempt to arrange this ?eld of knowledge systematically. In this book we will follow two guidelines. One guideline is a distinction - tween scheduling models which comprise a set of scheduling problems solved by dedicated algorithms. Thus, the aim of this book is to present scheduling models for parallel processing, problems de?ned on the grounds of certain scheduling models, and algorithms solving the scheduling problems. Most of the scheduling problems are combinatorial in nature. Therefore, the second guideline is the methodology of computational complexity theory. Inthisbookwepresentfourexamplesofschedulingmodels. Wewillgodeepinto the models, problems, and algorithms so that after acquiring some understanding of them we will attempt to draw conclusions on their mutual relationships.
Download or read book Designing Scheduling Algorithms Via a Mathematical Perspective written by Sami Davies and published by . This book was released on 2021 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This document will discuss three problems that I worked on during my Ph.D. Chapter 2 contains my work on the Santa Claus problem, and Chapters 3 and 4 contain my work on scheduling with precedence constraints and communication delays. New algorithms for scheduling and resource allocation problems have far reaching implications, as problems in scheduling and resource allocation are a foundational playground for studying computational hardness and are practically relevant. In the Santa Claus problem, Santa has a set of gifts, and he wants to distribute them among a set of children so that the least happy child is as happy as possible. Child i has value pij for present j, where pij is in { 0,pj}. A modification of Haxell's hypergraph matching argument by Annamalai, Kalaitzis, and Svensson gives a 12.33-approximation algorithm for the problem. In joint work with Thomas Rothvoss and Yihao Zhang, we introduce a matroid version of the Santa Claus problem. While our algorithm is also based on the augmenting tree by Haxell, the introduction of the matroid structure allows us to solve a more general problem with cleaner methods. Using our result from the matroid version of the problem, we obtain a (4+epsilon) approximation algorithm for Santa Claus. In scheduling theory, one of the most poorly understood, yet practically interesting, models is scheduling in the presence of communication delays. Here, if two jobs are dependent and scheduled on different machines, then at least c units of time must pass between their executions. Even for the special case where an unlimited number of identical machines are available, the best known approximation ratio for minimizing makespan is O(c). An outstanding open problem in the top-10 list by Schuurman and Woeginger (and its recent update by Bansal) asks whether there exists a constant-factor approximation algorithm. In joint work with Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, and Yihao Zhang, we prove a O(log c · log m)-approximation algorithm for the problem of minimizing makespan on m identical machines; this work is presented in Chapter 3. Our approach is based on a Sherali-Adams lift of a linear programming relaxationand a randomized clustering of the semimetric space induced by this lift. We extend our work to the related machines setting and study the objectives of minimizing makespan and minimizing the weighted sum of completion times. Here, we also obtain polylogarithmic approximation algorithms, and these results are presented in Chapter 4.
Download or read book The Design of Approximation Algorithms written by David P. Williamson and published by Cambridge University Press. This book was released on 2011-04-26 with total page 518 pages. Available in PDF, EPUB and Kindle. Book excerpt: Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
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 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 Integer Programming and Related Areas written by Rabe v. Randow and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 522 pages. Available in PDF, EPUB and Kindle. Book excerpt: The fields of integer programming and combinatorial optimization continue to be areas of great vitality, with an ever increasing number of publications and journals appearing. A classified bibliography thus continues to be necessary and useful today, even more so than it did when the project, of which this is the fifth volume, was started in 1970 in the Institut fur Okonometrie und Operations Research of the University of Bonn. The pioneering first volume was compiled by Claus Kastning during the years 1970 - 1975 and appeared in 1976 as Volume 128 of the series Lecture Notes in Economics and Mathematical Systems published by the Springer Verlag. Work on the project was continued by Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and resulted in the publication of the second, third, and fourth volumes in 1978, 1982, and 1985 (Volumes 160, 197, and 243 of the above series). The present book constitutes the fifth volume of the bibliography and covers the period from autumn 1984 to the end of 1987. It contains 5864 new publications by 4480 authors and was compiled by Rabe von Randow. Its form is practically identical to that of the first four volumes, some additions having been made to the subject list.
