Scheduling malleable tasks on parallel processors to minimize the makespan
From MaRDI portal
Publication:596452
Recommendations
Cited in
(24)- Packing-based branch-and-bound for discrete malleable task scheduling
- Multiresource malleable task scheduling to minimize response time
- Rescheduling to minimize makespan on a changing number of identical processors
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Scheduling trees of malleable tasks for sparse linear algebra
- Polyhedral results and branch-and-cut for the resource loading problem
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- Scheduling in-house transport vehicles to feed parts to automotive assembly lines
- Efficient approximation algorithms for scheduling moldable tasks
- Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
- Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space
- Optimal workforce assignment to operations of a paced assembly line
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Resource level minimization in the discrete-continuous scheduling
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- Scheduling parallel jobs online with convex and concave parallelizability
- Scheduling parallel jobs to minimize the makespan
- Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
- Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
- Makespan of a batch of partitionable tasks
- A two-pass scheduling algorithm for parallel programs
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)
