Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Scheduling tree-structured tasks with restricted execution times

From MaRDI portal
Publication:1111371
Jump to:navigation, search

DOI10.1016/0020-0190(88)90206-2zbMath0658.68040OpenAlexW2019483472MaRDI QIDQ1111371

Joseph Y.-T. Leung, Jian-Zhong Du

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90206-2


zbMATH Keywords

multiprocessor schedulingNP-completenessNP-hardnessschedule lengthtree-structured task system


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items (2)

Scheduling of resource tasks ⋮ A note on minimum makespan assembly plans



Cites Work

  • Bin packing with divisible item sizes
  • NP-complete scheduling problems
  • Optimal scheduling for two-processor systems
  • On Scheduling Independent Tasks with Restricted Execution Times
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Scheduling tree-structured tasks with restricted execution times

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1111371&oldid=13151687"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki