Greedy scheduling with custom-made objectives

DOI10.1007/S10479-008-0491-2zbMath1202.90152OpenAlexW2080064769WikidataQ130471463 ScholiaQ130471463MaRDI QIDQ613772

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

zbMATH Keywords

computational intelligencecomputational gridsonline job schedulingworkload based scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

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

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