A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time

DOI10.1016/j.cor.2011.02.023zbMath1251.90182OpenAlexW2023550293MaRDI QIDQ1762110

Ruslan Sadykov

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.023

zbMATH Keywords

combinatorial optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (5)

Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ Resource loading with time windows ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Scheduling semi-malleable jobs to minimize mean flow time ⋮ Packing-based branch-and-bound for discrete malleable task scheduling

Cites Work

• Scheduling with Deadlines and Loss Functions
• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• Scheduling Jobs on Several Machines with the Job Splitting Property
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time