Scheduling independent tasks with multiple modes
DOI10.1016/0166-218X(95)00003-AzbMATH Open0837.90064OpenAlexW1966303487MaRDI QIDQ1900136FDOQ1900136
Authors: Yanyan Li 
Publication date: 17 October 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(95)00003-a
Recommendations
- A new approach for scheduling independent tasks with multiple modes
- Scheduling independent multiprocessor tasks
- Scheduling independent multiprocessor tasks
- scientific article; zbMATH DE number 1979516
- Multitasking scheduling with alternate periods
- Scheduling Independent Tasks on Uniform Processors
- Scheduling parallel tasks with individual deadlines
- Scheduling parallel tasks with individual deadlines
- scientific article; zbMATH DE number 1234084
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)
Cites Work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3900787 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A decomposition approach for a resource constrained scheduling problem
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- Hierarchical models for multi-project planning and scheduling
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- On chromatic number of finite set-systems
- On graphs with polynomially solvable maximum-weight clique problem
- On the Maximum Weight Clique Problem
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Scheduling multiprocessor tasks on three dedicated processors
- The complexity of scheduling independent two-processor tasks on dedicated processors
Cited In (7)
- A new approach for scheduling independent tasks with multiple modes
- Efficiency and effectiveness of normal schedules on three dedicated processors
- Title not available (Why is no real title available?)
- Scheduling multiprocessor tasks -- An overview
- Title not available (Why is no real title available?)
- Heuristics for multimode scheduling problems with dedicated resources
- Title not available (Why is no real title available?)
This page was built for publication: Scheduling independent tasks with multiple modes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900136)
