Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Analysis of first-come-first-serve parallel job scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science
On-line single-server dial-a-ride problems
Theoretical Computer Science
Resource Scheduling for Composite Multimedia Objects
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On-Line Scheduling with Precedence Constraints
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Scheduling of Independent Dedicated Multiprocessor Tasks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Online Dial-a-Ride Problems: Minimizing the Completion Time
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Experimental Study of Online Scheduling Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Approximating Call-Scheduling Makespan in All-Optical Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An experimental study of online scheduling algorithms
Journal of Experimental Algorithmics (JEA)
Bi-criteria algorithm for scheduling jobs on cluster platforms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
Utilization of nonclairvoyant online schedules
Theoretical Computer Science
On-line scheduling mesh jobs with dependencies
Theoretical Computer Science
The Dynamic Assignment Problem
Transportation Science
On the truthfulness and the approximation for scheduling selfish tasks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Resource scheduling with variable requirements over time
Journal of Scheduling
Idle regulation in non-clairvoyant scheduling of parallel jobs
Discrete Applied Mathematics
Journal of Scheduling
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On truthfulness and approximation for scheduling selfish tasks
Journal of Scheduling
Optimal and online preemptive scheduling on uniformly related machines
Journal of Scheduling
An on-line algorithm for the rectangle packing problem with rejection
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Online deadline scheduling with preemption penalties
Computers and Industrial Engineering
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Two level job-scheduling strategies for a computational grid
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Optimal algorithms for online single machine scheduling with deteriorating jobs
Theoretical Computer Science
A comment on scheduling on uniform machines under chain-type precedence constraints
Operations Research Letters
Scheduling on identical machines: How good is LPT in an on-line setting?
Operations Research Letters
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
Online strip packing with modifiable boxes
Operations Research Letters
Multiple Workflow Scheduling Strategies with User Run Time Estimates on a Grid
Journal of Grid Computing
A framework for scheduling with online availability
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Cooperation in multi-organization scheduling
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Energy-Aware Scheduling on Multicore Heterogeneous Grid Computing Systems
Journal of Grid Computing
| Hi-index | 0.01 |
The problem of scheduling jobs on parallel machines is studied when (1) the existence of a job is not known until its unknown release date and (2) the processing requirement of a job is not known until the job is processed to completion. Two general algorithmic techniques are demonstrated for converting existing polynomial-time algorithms that require complete knowledge about the input data into algorithms that need less advance knowledge. Information-theoretic lower bounds on the length of on-line schedules are proven for several basic parallel machine models, and that almost all of our algorithms construct schedules with lengths that either match or come within a constant factor of the lower bound.