On-line scheduling of parallel jobs on two machines
DOI10.1016/J.JDA.2006.07.005zbMATH Open1279.90062OpenAlexW2093901218MaRDI QIDQ954945FDOQ954945
Authors: Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Guochuan Zhang 
Publication date: 18 November 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.07.005
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Title not available (Why is that?)
- On-line scheduling of parallel jobs with runtime restrictions
- Optimal on-line scheduling of parallel jobs with dependencies
- On an on-line scheduling problem for parallel jobs
- Structural Information and Communication Complexity
Cited In (31)
- On-line scheduling of two parallel machines with a single server
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
- Online scheduling of parallel jobs with preemption on two identical machines
- Online over time processing of combinatorial problems
- Online C-benevolent job scheduling on multiple machines
- On-line scheduling of multi-core processor tasks with virtualization
- On-line scheduling revisited
- Online scheduling of parallel jobs with bounded processing times on two machines
- An online scheduling of two type parallel jobs on identical machines
- Dynamic on-line task scheduling on parallel processors
- Title not available (Why is that?)
- On-line multi-threaded scheduling
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- On an on-line scheduling problem for parallel jobs
- On-line two-machine job shop scheduling with time lags
- Parallel machine scheduling with special jobs
- On-line scheduling of parallel jobs in a list
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
- On-line scheduling of parallel jobs in heterogeneous multiple clusters
- Online scheduling of parallel jobs on two machines is 2-competitive
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- Title not available (Why is that?)
- Partial servicing of on-line jobs
- On-line scheduling of jobs with order arrival time and hard deadline on two parallel identical machines
- Online MapReduce processing on two identical parallel machines
- Title not available (Why is that?)
- Structural Information and Communication Complexity
- On-line parallel machine scheduling with selective jobs
- Scheduling Parallel Machines On-Line
- On-line parallel machine scheduling with special jobs to minimize the makespan
- Title not available (Why is that?)
This page was built for publication: On-line scheduling of parallel jobs on two machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954945)
