Greedy scheduling with custom-made objectives

DOI10.1007/S10479-008-0491-2MaRDI QIDQ613772zbMATH OpenOpenAlexWikidataFDO

Authors Carsten Franke, Joachim Lepping, Uwe Schwiegelshohn

Publication date 22 December 2010

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-008-0491-2

zbMATH Keywords

computational intelligencecomputational gridsonline job schedulingworkload based scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Multi-objective scheduling
• A system-centric metric for the evaluation of online job schedules
• Fast multi-objective rescheduling of grid jobs by heuristics and evolution
• An experimental study of online scheduling algorithms
• Efficient grid scheduling through the incremental schedule-based approach

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 1082102 (Why is no real title available?)
• scientific article; zbMATH DE number 1082103 (Why is no real title available?)
• scientific article; zbMATH DE number 1946761 (Why is no real title available?)
• A graph-based hyper-heuristic for educational timetabling problems
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Evolution strategies. A comprehensive introduction
• Fairness in parallel job scheduling
• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• The workload on parallel supercomputers: Modeling the characteristics of rigid jobs

Cited in

(2)

• Greed in resource scheduling
• On mind evolutionary computation based job scheduling for server clusters

This page was built for publication: Greedy scheduling with custom-made objectives

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