Greedy scheduling with custom-made objectives

DOI10.1007/S10479-008-0491-2zbMATH Open1202.90152OpenAlexW2080064769WikidataQ130471463 ScholiaQ130471463MaRDI QIDQ613772FDOQ613772

Joachim Lepping, Uwe Schwiegelshohn, Carsten Franke

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

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

zbMATH Keywords

computational intelligencecomputational gridsonline job schedulingworkload based scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• Title not available (Why is that?)
• Evolution strategies. A comprehensive introduction
• A graph-based hyper-heuristic for educational timetabling problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Fairness in parallel job scheduling
• The workload on parallel supercomputers: Modeling the characteristics of rigid jobs
• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Title not available (Why is that?)

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)