Scheduling independent tasks with multiple modes

DOI10.1016/0166-218X(95)00003-AzbMath0837.90064OpenAlexW1966303487MaRDI QIDQ1900136

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

zbMATH Keywords

makespanrenewable resourcesnonpreemptive scheduling

Mathematics Subject Classification ID

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)

Related Items

A new approach for scheduling independent tasks with multiple modes, Efficiency and effectiveness of normal schedules on three dedicated processors, Scheduling multiprocessor tasks -- An overview, Unnamed Item, Heuristics for multimode scheduling problems with dedicated resources

Cites Work

• The complexity of scheduling independent two-processor tasks on dedicated processors
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Scheduling multiprocessor tasks on three dedicated processors
• A decomposition approach for a resource constrained scheduling problem
• 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
• On the Maximum Weight Clique Problem
• On graphs with polynomially solvable maximum-weight clique problem
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• On chromatic number of finite set-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item