Scheduling malleable tasks on parallel processors to minimize the makespan
From MaRDI portal
Publication:596452
DOI10.1023/B:ANOR.0000030682.25673.c0zbMath1056.90055WikidataQ57387800 ScholiaQ57387800MaRDI QIDQ596452
Denis Trystram, Maciej Machowiak, Jacek Błażewicz, Jan Weglarz, Mikhail Y. Kovalyov
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
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 ⋮ A hybrid exact method for a scheduling problem with a continuous resource and energy constraints ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Optimal workforce assignment to operations of a paced assembly line ⋮ Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions ⋮ An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Scheduling in-house transport vehicles to feed parts to automotive assembly lines ⋮ Scheduling malleable tasks with interdependent processing rates: comments and observations ⋮ Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem ⋮ Resource level minimization in the discrete-continuous scheduling ⋮ Packing-based branch-and-bound for discrete malleable task scheduling
