Pages that link to "Item:Q1762110"
From MaRDI portal
The following pages link to A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110):
Displayed 5 items.
- Resource loading with time windows (Q319369) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines (Q3455878) (← links)