Scheduling parallel jobs to minimize the makespan
From MaRDI portal
Publication:880560
DOI10.1007/s10951-006-8497-6zbMath1154.90464OpenAlexW2045215405MaRDI QIDQ880560
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/36804
list schedulingmultiprocessor schedulingonline algorithmsrelease datesapproximation algorithmsparallel jobs
Related Items (29)
Rectangle packing with one-dimensional resource augmentation ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Online scheduling of two type parallel jobs on identical machines ⋮ Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms ⋮ Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ A new lower bound for online strip packing ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ A tight analysis of Brown-Baker-Katseff sequences for online strip packing ⋮ The generalization of scheduling with machine cost ⋮ Improved upper bounds for online malleable job scheduling ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ Improved online algorithms for parallel job scheduling and strip packing ⋮ Unnamed Item ⋮ A fuzzy random resource-constrained scheduling model with~multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ Online scheduling of parallel jobs on two machines is 2-competitive ⋮ WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION ⋮ On-line scheduling of parallel jobs in a list ⋮ New upper bounds for online strip packing ⋮ A new upper bound for the online square packing problem in a strip ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines ⋮ Online Algorithm for Parallel Job Scheduling and Strip Packing ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES ⋮ Preemptive scheduling in the presence of transportation times ⋮ A note on online strip packing ⋮ Improved lower bound for online strip packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 2.5 times optimal algorithm for packing in two dimensions
- Scheduling multiprocessor tasks -- An overview
- Dynamic scheduling on parallel machines
- Scheduling on identical machines: How good is LPT in an on-line setting?
- On-line scheduling revisited
- On an on-line scheduling problem for parallel jobs
- Scheduling multiprocessor tasks on hypercubes
- Scheduling with Deadlines and Loss Functions
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- Bounds for naive multiple machine scheduling with release times and deadlines
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- A New Algorithm for Preemptive Scheduling of Trees
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Better Bounds for Online Scheduling
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Some simple scheduling algorithms
- Scheduling Parallel Machines On-Line
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling independent multiprocessor tasks
This page was built for publication: Scheduling parallel jobs to minimize the makespan
