Online Algorithm for Parallel Job Scheduling and Strip Packing

DOI10.1007/978-3-540-77918-6_6zbMath1130.90328OpenAlexW2115015692MaRDI QIDQ5443373

Johann L. Hurink, Jacob Jan Paulus

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_6

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

A new lower bound for online strip packing ⋮ A tight analysis of Brown-Baker-Katseff sequences for online strip packing ⋮ Online multiple-strip packing ⋮ Unnamed Item ⋮ New upper bounds for online strip packing ⋮ A new upper bound for the online square packing problem in a strip ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ Online scheduling of moldable parallel tasks ⋮ Improved lower bound for online strip packing

Cites Work

• Unnamed Item
• Scheduling parallel jobs to minimize the makespan
• Online scheduling of parallel jobs on two machines is 2-competitive
• On-line scheduling of parallel jobs in a list
• A note on online strip packing
• Shelf Algorithms for Two-Dimensional Packing Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Structural Information and Communication Complexity

This page was built for publication: Online Algorithm for Parallel Job Scheduling and Strip Packing