Optimal Scheduling of Tasks on Identical Parallel Processors
From MaRDI portal
Publication:4896446
Recommendations
- scientific article; zbMATH DE number 1234084
- scientific article; zbMATH DE number 3941253
- A note on scheduling multiprocessor tasks with identical processing times.
- Scheduling malleable tasks on parallel processors to minimize the makespan
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
Cited in
(63)- Minimization of the number of devices under working in systems of identical parallel devices
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- scientific article; zbMATH DE number 6007890 (Why is no real title available?)
- Makespan of a batch of partitionable tasks
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- scientific article; zbMATH DE number 1206104 (Why is no real title available?)
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- A new approach for bicriteria partitioning problem
- An analysis of lower bound procedures for the bin packing problem
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- Exact algorithms for scheduling programs with shared tasks
- Some algorithms of solving minimax multiprocessor scheduling problem
- Rescheduling to minimize makespan on a changing number of identical processors
- Routing problems with loading constraints
- A characterization of optimal multiprocessor schedules and new dominance rules
- A nonidentical parallel processor scheduling problem
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
- Metaheuristics for the vehicle routing problem with loading constraints
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- Production scheduling of independent jobs on parallel identical processors
- Exact solution techniques for two-dimensional cutting and packing
- Minimizing labor requirements in a periodic vehicle loading problem
- Optimal read-once parallel disk scheduling
- A composite algorithm for multiprocessor scheduling
- Minimizing the makespan on two identical parallel machines with mold constraints
- Improved approaches to the exact solution of the machine covering problem
- Improved algorithms to minimize workload balancing criteria on identical parallel machines
- Scheduling parallel processors: Structural properties and optimal policies
- A note on posterior tight worst-case bounds for longest processing time schedules
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Exact and approximate methods for a one-dimensional minimax bin-packing problem
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Properties of some ILP formulations of a class of partitioning problems
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Maximizing the minimum completion time on parallel machines
- An exact algorithm for parallel machine scheduling with conflicts
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Two-dimensional packing problems: a survey
- Tight bounds for the identical parallel machine scheduling problem
- The complexity of finding Nash equilibria
- Partial solutions and multifit algorithm for multiprocessor scheduling
- scientific article; zbMATH DE number 2090583 (Why is no real title available?)
- A computational study of lower bounds for the two dimensional bin packing problem
- Bee colony optimization for scheduling independent tasks to identical processors
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Recent advances on two-dimensional bin packing problems
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- Fast lifting procedures for the bin packing problem
- A new destructive bounding scheme for the bin packing problem
- The off-line group seat reservation problem
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS
- Optimal scheduling of progressive processing tasks
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Optimal allocation of requirements to parallel devices
- A note on scheduling multiprocessor tasks with identical processing times.
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
- Task scheduling for multiunit parallel test using mixed-integer linear programming
This page was built for publication: Optimal Scheduling of Tasks on Identical Parallel Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896446)
