Preemptive online algorithms for scheduling with machine cost (Q1777224)

From MaRDI portal

Revision as of 10:27, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Preemptive online algorithms for scheduling with machine cost	scientific article

Statements

scholarly article

0 references

Preemptive online algorithms for scheduling with machine cost (English)

0 references

0 references

0 references

Acta Informatica

0 references

publication date

12 May 2005

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00236-004-0156-9

0 references

An optimal algorithm for preemptive on-line scheduling

0 references

Better Online Algorithms for Scheduling with Machine Cost

0 references

Semi-online algorithms for parallel machine scheduling problems

0 references

Bin stretching revisited

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Semi-online scheduling with machine cost.

0 references

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

0 references

Semi on-line scheduling on two identical machines

0 references

0 references

Semi on-line algorithms for the partition problem

0 references

A guessing game and randomized online algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00236-004-0156-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1777224

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1777224&oldid=34398484"