NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.066 seconds)

Spelling suggestions: "subject:"scheduling heuristik"" "subject:"scheduling heuristika""

1

Simple metaheuristics for scheduling

Besten, Matthijs Leendert den. Unknown Date (has links)
Techn. University, Diss., 2004--Darmstadt.
2

Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks

Müller, Dirk, Werner, Matthias 01 November 2012 (has links)
Partitioned preemptive EDF scheduling is very similar to bin packing, but there is a subtle difference. Estimating the probability of schedulability under a given total utilization has been studied empirically before. Here, we show an approach for closed-form formulae for the problem, starting with n = 3 tasks on m = 2 processors.
info:eu-repo/classification/ddc/004
ddc:004
Scheduling; Heuristik

Page generated in 0.0693 seconds