Complexity of a class of task scheduling problems

MaRDI QIDQ2711272zbMATH OpenFDO

Authors Tony Wong, Jean-Louis Houle, Ruxandra Mihaela Botez

Publication date 6 May 2001

Published in Libertas Mathematica (Search for Journal in Brave)

zbMATH Keywords

task scheduling problems

Mathematics Subject Classification ID

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

Recommendations

• Computational complexity of some scheduling problems with multiprocessor tasks
• On the complexity of scheduling tasks with discrete starting times
• Complexity of the Project Sequencing Problem
• The proof on the NP-completeness of two batching scheduling problems
• The complexity of scheduling problems with communication delays for trees

Cited in

(12)

• Computational complexity of some scheduling problems with multiprocessor tasks
• The counting complexity of a simple scheduling problem
• On the complexity of scheduling tasks with discrete starting times
• The complexity of multidimensional periodic scheduling
• Complexity of scheduling problems with multi-purpose machines
• Complexity of some special types of timetabling problems
• On the extension complexity of scheduling polytopes
• Complexity of the Project Sequencing Problem
• Complete Complexity Classification of Short Shop Scheduling
• Counting and enumeration complexity with application to multicriteria scheduling
• On the computational complexity of (maximum) shift class scheduling
• Scheduling and fixed-parameter tractability

This page was built for publication: Complexity of a class of task scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2711272)