“An” On-line Scheduling Heuristic with Better Worst Case Ratio Than Graham's List Scheduling PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download “An” On-line Scheduling Heuristic with Better Worst Case Ratio Than Graham's List Scheduling PDF full book. Access full book title “An” On-line Scheduling Heuristic with Better Worst Case Ratio Than Graham's List Scheduling by Gábor Galambos. Download full books in PDF and EPUB format.
Author: Gábor Galambos
Publisher:
ISBN:
Category : Multiprocessors
Languages : en
Pages : 10
Get Book Here
Book Description
Abstract: "We consider the problem of on-line scheduling a set of independent jobs on m machines. The goal is to minimize the makespan of the schedule. Graham's List Scheduling heuristic [2] guarantees a worst case performance of 2 - 1/m for this problem. This worst case bound cannot be improved for m=2 and m=3. For m [> or =] 4, we present approximation algorithms with worst case performance at most 2 - 1/m - [epsilon][subscript m], where [epsilon][subscript m] is some positive real depending on m."
Author: Gábor Galambos
Publisher:
ISBN:
Category : Multiprocessors
Languages : en
Pages : 10
Get Book Here
Book Description
Abstract: "We consider the problem of on-line scheduling a set of independent jobs on m machines. The goal is to minimize the makespan of the schedule. Graham's List Scheduling heuristic [2] guarantees a worst case performance of 2 - 1/m for this problem. This worst case bound cannot be improved for m=2 and m=3. For m [> or =] 4, we present approximation algorithms with worst case performance at most 2 - 1/m - [epsilon][subscript m], where [epsilon][subscript m] is some positive real depending on m."
Author: Gábor Galambos
Publisher:
ISBN:
Category :
Languages : de
Pages : 10
Get Book Here
Book Description
Author:
Publisher: SIAM
ISBN: 9780898713664
Category : Mathematics
Languages : en
Pages : 608
Get Book Here
Book Description
This text covers the proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, which was held in Atlanta, Georgia, in January 1996.
Author: Gerard Cornuejols
Publisher: Springer
ISBN: 3540487778
Category : Mathematics
Languages : en
Pages : 463
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization, IPCO'99, held in Graz, Austria, in June 1999. The 33 revised full papers presented were carefully reviewed and selected from a total of 99 submissions. Among the topics addressed are theoretical, computational, and application-oriented aspects of approximation algorithms, branch and bound algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diaphantine equations, geometry of numbers, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling, and semidefinite programs.
Author: Bo Chen
Publisher: I.B.D. Limited
ISBN:
Category : Mathematics
Languages : en
Pages : 156
Get Book Here
Book Description
"Attempts to cope with the challenge of optimal utilization of limited resources in accomplishing variegated tasks have resulted in an exciting field known as scheduling theory. The resources and tasks are commonly referred to as machines and jobs, respectively. In this thesis efficient heuristic algorithms are developed, which quickly provide near optimal solutions for various problems in scheduling theory that are practically intractable to solve to optimality. The worst-case performance of the heuristic algorithms is thoroughly analyzed. With respect to machine environments, the scheduling problems considered range from parallel machine shops, through open and flow shops, to common generalizations of the classical shop models. With respect to the job characteristics, these problems may involve preemptive or non-preemptive scheduling, with setup times included in or separated from processing times. With respect to the ways jobs are released and scheduled, both off-line and on-line problems are investigated."--BOOK JACKET.Title Summary field provided by Blackwell North America, Inc. All Rights Reserved
Author: Michael Luby
Publisher: Springer
ISBN: 3540495436
Category : Computers
Languages : en
Pages : 394
Get Book Here
Book Description
This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, held in Barcelona, Spain, in October 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. Also included are three invited contributions. Among the topics addressed are graph computation, derandomization, pattern matching, computational geometry, approximation algorithms, search algorithms, sorting, and networking algorithms.
Author: Joseph Y-T. Leung
Publisher: CRC Press
ISBN: 0203489802
Category : Business & Economics
Languages : en
Pages : 1215
Get Book Here
Book Description
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.
Author: Dingzhu Du
Publisher: Springer Science & Business Media
ISBN: 9783540602163
Category : Combinatorial analysis
Languages : en
Pages : 676
Get Book Here
Book Description
This book constitutes the proceedings of the First Annual International Conference on Computing and Combinatorics, COCOON '95, held in Xi'an, China in August 1995. The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, there are sections on complexity theory, graph drawing, computational geometry, databases, graph algorithms, distributed programming and logic, combinatorics, machine models, combinatorial designs, algorithmic learning, algorithms, distributed computing, and scheduling.
Author: Michael S. Paterson
Publisher: Springer Science & Business Media
ISBN: 354041004X
Category : Computers
Languages : en
Pages : 463
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrcken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms.
Author: Dorit Hochbaum
Publisher: Springer
ISBN: 3540484132
Category : Computers
Languages : en
Pages : 297
Get Book Here
Book Description
This book constitutes the refereed proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX'99, in Berkeley, California in August 1999. The volume presents 24 revised full papers selected from 44 submissions and four invited contributions. The papers present a wealth of new results and document the state-of-the-art in the areas covered by the workshop.
