Scheduling with Concurrency-Based Constraints

This paper considers scheduling problems with timing constraints of the forms < (precedence), ≤ (no later than), and ≐ (concurrence). Scheduling unit-time jobs subject to < and ≐ constraints, and scheduling unit-time jobs subject to ≤ constraints, are proved NP-complete for fixed k ≥ 3 process...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of algorithms Ročník 18; číslo 1; s. 98 - 123
Hlavní autoři:	Berger, B., Cowen, L.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 1995 Elsevier
Témata:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Software Software engineering Processor Optimal algorithm Constraint Concurrency NP complete problem Scheduling Timing Parallelization
ISSN:	0196-6774, 1090-2678
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!