Computational complexity of some scheduling problems with multiprocessor tasks

DOI10.1016/j.disopt.2005.08.001zbMath1166.90344OpenAlexW2014334704MaRDI QIDQ1019301

Van Ha Do, Yakov Zinder, Oguz, Ceyda

Publication date: 2 June 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.08.001

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ Scheduling multiprocessor UET tasks of two sizes

Cites Work

• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Scheduling multiprocessor tasks -- An overview
• Scheduling UET task systems with concurrency on two parallel identical processors
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• Scheduling multiprocessor tasks for mean flow time criterion
• A decomposition theorem for partially ordered sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item