Lucian Finta, Zhen Liu  Home/Search
Context Related
| inria.fr/INRIA/publicat...RR2198.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: sop.inria.fr/mistral/p...pub_list (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine such that the makespan is to be minimized. The executions of the tasks are constrained by precedence delays, i.e., a task can start its execution only after any of its predecessors has completed and the delay between the two tasks has elapsed. In the case of unit execution times and integer lengths of delays, the problem is shown to be NP-hard in the strong sense. In the... (Update)
Similar documents based on text: More All
0.5: Single Machine Scheduling Subject to Precedence Delays - Finta, Liu (1995) (Correct)
0.3: PARSEVAL: A Workbench for Queueing Networks Parallel Simulation - Mussi, Rakotoarisoa (1994) (Correct)
0.3: Deadlock Free Routing on a Ring: A Performance Evaluation - Liu, Mussi (1994) (Correct)
BibTeX entry: (Update)
Finta, L., Liu. Z. [1996] Single machine scheduling subject to precedence delays, Discrete Applied Mathematics 70, 247-266. http://citeseer.ist.psu.edu/finta94single.html More
@article{ finta96single,
author = "Finta and Liu",
title = "Single Machine Scheduling Subject to Precedence Delays",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "70",
year = "1996",
url = "citeseer.ist.psu.edu/finta94single.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
212 Optimization and Approximation in Deterministic Scheduling: .. (context) - Graham, Lawler et al. - 1979
204 Sequencing and Scheduling: Algorithms and Complexity (context) - Lawler, Lenstra et al. - 1989
152 Introduction to Sequencing and Scheduling (context) - Baker - 1974
112 NP-complete Scheduling Problems (context) - Ullman - 1975
93 The Shifting Bottleneck Procedure for Job Shop Scheduling (context) - Adams, Balas et al. - 1988
66 Optimal Scheduling for Two-Processor Systems (context) - Coffman, Graham - 1972
22 Scheduling UnitTime Tasks with Arbitrary Release Times and D.. (context) - Garey, Johnson et al. - 1981
15 Some Simple Scheduling Algorithms (context) - Horn - 1974
11 A Fast Algorithm for Single Processor Scheduling (context) - Simons - 1978
6 One Machine Scheduling with Delayed Precedence Constraints (context) - Balas, Lenstra et al. - 1993
5 Single Machine Scheduling Research (context) - Gupta, Kyparisis - 1987
4 Bicriterion Static Scheduling Research for a Single Machine (context) - Dileepan, Sen - 1988
3 The One-Machine Scheduling Problem (context) - Carlier - 1982
2 Scheduling Task Graphs in Single Communication Bus Multiproc.. (context) - Finta, Liu
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sop.inria.fr/mistral/personnel/Lucian.Finta/pub_list.html): More
Single Machine Scheduling Subject to Precedence Delays - Finta, Liu (1995) (Correct)
Scheduling UET-UCT Series-Parallel Graphs on Two Processors - Finta, Liu, Milis, Bampis (1996) (Correct)
Scheduling UET-UCT Series-Parallel Graphs on Two Processors - Finta, Liu, Milis, Bampis (1996) (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