scientific article; zbMATH DE number 1559404

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(200010)47:7<593::AID-NAV4>3.0.CO;2-H" /><593::AID-NAV4>3.0.CO;2-H 10.1002/1520-6750(200010)47:7<593::AID-NAV4>3.0.CO;2-HzbMath0991.90070MaRDI QIDQ4526868

Vladimir Kotov, Yong He, Hans Kellerer

Publication date: 31 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partitionmultiprocessor schedulinganalysis of algorithmskernelworst-case analysismachine release time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Linear time algorithms for parallel machine scheduling ⋮ The longest processing time rule for identical parallel machines revisited ⋮ Multiprofessor scheduling ⋮ A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem ⋮ An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines ⋮ Two semi-online scheduling problems on two uniform machines ⋮ The multifit algorithm for set partitioning containing kernels ⋮ A linear compound algorithm for uniform machine scheduling ⋮ Semi on-line algorithms for the partition problem

Cites Work

• Parallel machines scheduling with nonsimultaneous machine available time
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
• Joint performance of greedy heuristics for the integer knapsack problem
• Analysis of a Compound Bin Packing Algorithm
• Algorithms for Scheduling Independent Tasks
• An Application of Bin-Packing to Multiprocessor Scheduling

This page was built for publication: