Donald William Gillies  Home/Search
Context Related
| uiuc.edu/papers/./Gill93.ps.gz uiuc.edu/papers/./Gill93.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper surveys much of the classical and current work in the area of path problems on digraphs. After a search of more than sixty five papers that reference Warshall's algorithm, we have concluded that our work on threshold transitive closure has probably not appeared in the literature. This work does not fit easily into any of the previous axiomatic treatments of Warshall's algorithm, and it may be possible to axiomize our work to solve AND/OR path problems, thereby generalizing much of... (Update)
Context of citations to this paper: More
...constraints. However, a series of papers by Gillies et al., study several variants of scheduling with and or precedence constraints [24, 25]. Our model for this problem was chosen to be similar to [24, 25] however with one key difference. As mentioned in Section 5.2, the...
...in polynomially time by computing a depth order. A model for scheduling with and or precedence constraints has been studied earlier [19, 20], but with one key difference. The precedence constraints for an instance can be represented as a directed graph 6 with each node...
Cited by: More
Complexity Measures for Assembly Sequences - Goldwasser, Motwani (1999) (Correct)
Intractability of Assembly Sequencing: Unit Disks in the Plane - Goldwasser, Motwani (1997) (Correct)
Scheduling Tasks With And/or Precedence Constraints - Liu (1995) (Correct)
Active bibliography (related documents): More All
0.5: Crew Scheduling Based on Constraint Programming.. - Halatsis.. (1996) (Correct)
0.5: A Standalone Wire Database for Routing and Tracing in Xilinx.. - Steiner (2002) (Correct)
0.5: Improvements on a Heuristic Algorithm for Multiple-Query.. - Shim (1994) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Training Students In Parallel And Distributed Thinking By.. - Kienzle (Correct)
0.1: An Architecture for Mobile, Distributed Application.. - Jones, Vrbsky, Zhang.. (Correct)
0.1: Pipelined Bursts in Real-Time Scheduling - Gillies (1998) (Correct)
Related documents from co-citation: More All
7: Scheduling tasks with AND/OR precedence constraints - Gillies, Liu - 1995
7: Stanford Technical Report STAN-CS (context) - Wilson, Assembly et al. - 1992
7: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
D. Gillies. Algorithms to schedule tasks with AND/OR precedence constraints. Ph.D. thesis, University of Illinois, Urbana, IL, 1993. http://citeseer.ist.psu.edu/159190.html More
@techreport{ gillies93algorithms,
author = "Donald William Gillies",
title = "Algorithms to schedule tasks with and/or precedence constraints",
number = "1819",
address = "Urbana, Illinois",
year = "1993",
url = "citeseer.ist.psu.edu/159190.html" }
Citations (may not include all citations):1582 Scheduling Algorithms for Multiprogramming in a Hard-Real-Ti.. - Liu, James - 1973
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft - 1974
293 Approximation Algorithms for Combinatorial Problems (context) - Johnson - 1974
219 Bounds on Multiprocessing Timing Anomalies (context) - Ronald - 1969
204 Sequencing and Scheduling: Algorithms and Complexity (context) - Lawler, Lenstra et al. - 1989
146 Computers and Intractibility: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
139 A Greedy Heuristic for the Set-Covering Problem (context) - Chvatal - 1979
127 Control Robotics: the Procedural Control of Physical Process.. (context) - Dertouzos - 1974
111 Computer and Job Shop Scheduling Theory (context) - Coffman - 1976
96 Parallel Sequencing and Assembly Line Problems (context) - Hu - 1961
79 Scheduling Periodic Jobs That Allow Imprecise Results (context) - Chung, Liu - 1990
74 The Recognition of Series Parallel Digraphs (context) - Jacobo, Tarjan et al. - 1979
74 the Ratio of Optimal Integral and Fractional Covers (context) - Lovasz - 1975
57 Complexity of Scheduling Parallel Task Systems (context) - Jianzhong, Y-T - 1989
43 Two-Processor Scheduling With Start Times and Deadlines (context) - Garey, Johnson - 1977
43 The Integration of Deadline and Criticalness in Hard Real-Ti.. (context) - Sara, John et al. - 1988
40 A Scheduling Algorithm for Conditional Resource Sharing (context) - Taewhan, Liu et al. - 1991
39 A Unified Approach to Path Problems (context) - Robert - 1981
35 Algorithms for Scheduling Imprecise Computations with timing.. - Shih, Liu - 1991
34 An Approximate Algorithm for the Partitionable Independent T.. - Belkhale, Banerjee - 1990
30 Scheduling Tasks With AND/OR Precedence Constraints - Donald, Jane et al. - 1993
30 Scheduling Tasks with AND/OR Precedence Constraints - Gillies, Liu - 1991
30 Scheduling tasks with AND/OR precedence constraints - Donald, Jane et al. - 1990
28 A Heuristic of Scheduling Parallel Tasks and its Analysis (context) - Qingzhou, Cheng - 1992
27 Set Covering Algorithms Using Cutting Planes (context) - Egon, Ho - 1980
26 Sequencing with Series-Parallel Precedence Constraints (context) - Clyde, Jeffrey et al. - 1979
25 One Machine Sequencing Algorithm for Minimizing the Number o.. (context) - Moore, An - 1968
23 Optimal Solution of Set Covering/Partitioning Problems Using.. (context) - Marshall, Pradeep - 1990
23 Parallelism Exposure and Exploitation in Programs (context) - Muraoka - 1971
22 Scheduling Unit-Time Tasks with Arbitrary Release Times and .. (context) - Garey, Johnson et al. - 1981
22 Scheduling Tasks with Nonuniform Deadlines on Two Processors (context) - Garey, Johnson - 1976
21 Shortest Path Methods: A Unifying Approach (context) - Giorgio, Pallottino - 1986
20 Dynamic Task Scheduling in Distributed Hard Real-Time System.. (context) - Ramamritham, Stankovic - 1984
14 Optimal task sequencing with precedence constraints (context) - Garey - 1973
13 Optimal Sequencing of Two Equivalent Processors (context) - Fuji, Kasami et al. - 1969
13 Bin Packing: Maximizing the Number of Pieces Packed (context) - Coffman, Leung et al. - 1978
12 Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary R.. (context) - Barbara - 1983
11 Algebraic Structures for Transitive Closure (context) - Daniel - 1977
11 A Modification of Warshall's Algorithm for the Transitive Cl.. (context) - Henry - 1975
10 OR Graph Representation of Assembly Plans (context) - Luiz, Homem et al. - 1986
10 Worst Case Analysis of Two Scheduling Algorithms (context) - Shui, Sethi - 1977
9 Transient Overloads in FaultTolerant Real-Time Systems (context) - Phillip, Trevidi - 1989
9 Parsing Flowcharts and Series-Parallel Graphs (context) - Jacobo - 1978
8 Greed in Resource Scheduling (context) - Donald, Jane et al. - 1991
6 Scheduling Imprecise Computations to Minimize Total Error (context) - Chung, Wei-Kuan et al. - 1989
6 Optimal sequencing Via Modular Decomposition: Characterizati.. (context) - Clyde, Jeffrey et al. - 1987
4 A Decomposition Algorithm for Sequencing with General Preced.. (context) - Jeffrey - 1981
3 A Framework for Specification and Design of Software for Adv.. (context) - Alice, Ellis - 1989
3 Optimal Diagnosis Procedures for k-out-of-n Structures (context) - Ming-Feng, Shi et al. - 1990
3 Transitivite et Connexite (context) - Roy - 1959
3 Guaranteeing Deadlines in MAFT (context) - Michelle - 1988
2 Cutting Planes from Conditional Bounds: A New Approach to Se.. (context) - Egon - 1980
2 AI Search for Minimum-Cost Set Cover and Multiple-Goal Plan .. (context) - Ambuj, Raghu et al. - 1990
2 Parallel Algorithms and VLSI Architectures for Robotics and .. (context) - Po-Rong - 1988
2 California: Tioga Publishing Company (context) - Nils, of et al. - 1980
1 Computational Experiences with Some Transitive Closure Algor.. (context) - Syslo, Dzikiewicz - 1975
1 Third Annual Office of Naval Research Workshop (context) - Joseph, in et al. - 1990
1 A General Best First Search Algorithm in AND/OR Graphs (context) - Chakrabarti, Ghose - 1992
1 Path-Balancing Algorithm for In-Trees: Implementation Docume.. (context) - Mohlalefi - 1991
1 A Theorem on Boolean Matrics (context) - Stephen - 1962
1 Scheduling Parallelizable Imprecise Computations on Multipro.. (context) - Albert, Kwei-Jay - 1991
1 New Jersey: Prentice-Hall (context) - Reingold, Nievergelt - 1977
1 Scheduling Parallelizable Jobs (context) - Donald - 1991
1 OR Graph Heuristic Search Methods (context) - Mahanti, Bagchi - 1985
1 An Analysis of Scheduling Algorithms in Multiprocessor Compu.. (context) - Nai-Fung - 1975
1 A New Heuristic for UET and Pipeline Scheduling (context) - Donald - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pertsserver.cs.uiuc.edu/papers/): More
Efficient Methods of Validating Timing Constraints - Liu, Ha (1995) (Correct)
Algorithms for Scheduling Imprecise Computations with Timing.. - Shih, Liu (1989) (Correct)
Algorithms for Scheduling Real-Time Tasks with Input Error and.. - Feng, Liu (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC