Heuristics for periodical batch job scheduling in a MapReduce computing framework
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7235219
- Improved algorithms for MapReduce scheduling on uniform machines
- Online MapReduce scheduling problem of minimizing the makespan
- Scheduling MapReduce jobs on identical and unrelated processors
- Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
Cites work
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- A two-stage hybrid flowshop with uniform machines and setup times
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Minimizing makespan in hybrid flowshops
- Optimal two- and three-stage production schedules with set-up time included
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling algorithms
- Scheduling flexible flow lines with sequence-dependent setup times
- Scheduling. Theory, algorithms, and systems.
- Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
- The hybrid flow shop scheduling problem
- Tuning an Algorithm Using Design of Experiments
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(3)
This page was built for publication: Heuristics for periodical batch job scheduling in a MapReduce computing framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750408)