Search results

...are adopted by [[branch and bound]] algorithms for solving multiprocessor scheduling problem. Fernandez's problem derives a better lower bound than HF{{What|dat *''A Comparison of List Scheduling for Parallel Processing Systems''{{fcn |date=June 2024}} ...

{{Short description|Task scheduling algorithm}} ...|first3=M. |year=2002 |title=Performance-effective and low-complexity task scheduling for heterogeneous computing |journal=IEEE Transactions on Parallel and Dist ...

{{Short description|Algorithm for scheduling problems}} ...t minimizes the maximum [[Tardiness (scheduling)|tardiness]], [[Tardiness (scheduling)|lateness]], or any function of them. ...

...er and developed by Yao et al.<ref>F.F. Yao, A.J. Demers and S. Shenker. A scheduling model for reduced [[CPU]] energy. Proc. 36th IEEE [[Symposium on Foundation ...ath> at speed <math>\Delta_I</math> according to [[Earliest deadline first scheduling|EDF]] ...

{{Short description|Class of greedy algorithms for multiway number partitioning}} ...such that the sums in the subsets are as nearly equal as possible. Greedy algorithms process the numbers sequentially, and insert the next number into a bin in ...

[[File:Pinwheel scheduling.svg|thumb|upright=1.2|An instance of the pinwheel scheduling problem: tasks A, B, and C have maximum repeat times 2, 4, and 5 respective ...problem is a problem in [[Scheduling analysis real-time systems|real-time scheduling]] with repeating tasks of unit length and hard constraints on the time bet ...

'''Identical-machines scheduling''' is an [[optimization problem]] in [[computer science]] and [[Operations ...ning]]. A special case of identical machine scheduling is [[single-machine scheduling]]. ...

...''s_j'' is the speed of machine ''j''), and [[identical-machines scheduling]] - in which ''p_i,j'' = ''p_i'' (the same run-time on ...roblem denoted by " '''R||'''<math>C_\max</math>" is an unrelated-machines scheduling problem with no constraints, where the goal is to minimize the maximum comp ...

...which is a special type of the more general [[Interval scheduling|Interval Scheduling]] problem. A classic application of this problem is in scheduling a room for multiple [[competing]] events, each having its own time requirem ...

{{Short description|Optimal job scheduling with some jobs done in parts}} '''Fractional job scheduling''' is a variant of [[optimal job scheduling]] in which it is allowed to break jobs into parts and process each part sep ...

...hful job scheduling''' is a [[mechanism design]] variant of the [[job shop scheduling]] problem from [[operations research]]. ...we have a standard optimization problem. In contrast, in the truthful job scheduling problem, the timings of the workers are not known. We ask each worker how m ...

...ave finished processing). In the specific variant known as ''parallel-task scheduling'', all machines are identical. Each job ''j'' has a ''length'' parameter '' ...lem of [[parallel-machines scheduling]] is a special case of parallel-task scheduling where <math> size_j=1 </math> for all ''j'', that is, each job should run o ...

{{Short description|Dynamic scheduling algorithm}} ...operating system]]s to place processes in a [[priority queue]]. Whenever a scheduling event occurs (task finishes, new task released, etc.) the queue will be sea ...

...is_title = Approximation Algorithms for Problems in Sequencing, Scheduling, and Communication Network Design ...rkeley]] in 1984. His major focus has been in the design and [[analysis of algorithms]] for discrete optimization problems. ...

...last1=Knop|first1=Dušan|last2=Koutecký|first2=Martin|date=2020-03-04|title=Scheduling Kernels via Configuration LP|class=cs.DS|eprint=2003.02187}}</ref> In the c ...rchive.org/web/20210715093252/https://www.coursera.org/learn/approximation-algorithms-part-1/home/week/3 |archive-date=2021-07-15 }}</ref> suppose the item sizes ...

Kinetic priority queues are used as part of other kinetic data structures/algorithms such as [[kinetic closest pair]], [[kinetic max-cut]]<ref name="max-cut"/> They can also be used to solve problems such as [[broadcast scheduling]]<ref name="tarjan"/> or the connected red blue segments intersection probl ...

Interval edge coloring has wide applications in various fields of science and scheduling. * One of the basic applications of interval edge coloring is the scheduling of the timetable for classes without clashes, in this application the class ...

...ast=Leighton|first=F.|date=1979|title=A graph coloring algorithm for large scheduling problems|journal=Journal of Research of the National Bureau of Standards|vo ...{Cite book|last=Lewis|first=R.|date=2021|title=A Guide to Graph Colouring: Algorithms and Applications|series=Texts in Computer Science |publisher=Springer|doi=1 ...

...hat there exists (or that there can be constructed) a set of complementary algorithms. ...thcal{I} \to \mathcal{P}</math> from instances <math>\mathcal{I}</math> to algorithms <math>\mathcal{P}</math> such that the cost <math> \sum_{i \in \mathcal{I}} ...

In [[parallel computing]], '''work stealing''' is a [[Scheduling (computing)|scheduling]] strategy for [[multithreading (software)|multithreaded]] computer program ...rk over idle processors, and as long as all processors have work to do, no scheduling overhead occurs.{{r|dfs}} ...