Scheduling malleable tasks on parallel processors to minimize the makespan

Cited In (20)

A two-pass scheduling algorithm for parallel programs
Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
Scheduling parallel jobs online with convex and concave parallelizability
Title not available (Why is that?)
An effective approximation algorithm for the malleable parallel task scheduling problem
Scheduling in-house transport vehicles to feed parts to automotive assembly lines
A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
Optimal workforce assignment to operations of a paced assembly line
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
Scheduling parallel jobs to minimize the makespan
Resource level minimization in the discrete-continuous scheduling
Scheduling malleable tasks with interdependent processing rates: comments and observations
Scheduling trees of malleable tasks for sparse linear algebra
Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
Efficient approximation algorithms for scheduling moldable tasks
Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space
Packing-based branch-and-bound for discrete malleable task scheduling
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

This page was built for publication: Scheduling malleable tasks on parallel processors to minimize the makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596452)