Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines

DOI10.1007/S10951-023-00788-4zbMATH Open1542.90098MaRDI QIDQ6547133

Could not fetch data.

Publication date: 30 May 2024

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

precedence constraintsfixed-parameter tractable algorithmtyped task system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving the job-shop scheduling problem optimally by dynamic programming
• Fundamentals of parameterized complexity
• Jackson's pseudo-preemptive schedule and cumulative scheduling problems
• A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
• Scheduling and fixed-parameter tractability
• Graph minors. I. Excluding a forest
• Performance analysis of multiprocessor systems containing functionally dedicated processors
• Analysis of scheduling problems with typed task systems
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• Parameterized complexity of machine scheduling: 15 open problems
• \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling]
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• Single-machine scheduling with release times, deadlines, setup times, and rejection
• The worst-case analysis of the Garey-Johnson algorithm
• Parameterized complexity of a coupled-task scheduling problem
• Scheduling meets \(n\)-fold integer programming
• The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Parametrized complexity theory.
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
• Scheduling precedence graphs of bounded height
• Two-Processor Scheduling with Start-Times and Deadlines
• Complexity of Scheduling under Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parameterized Algorithms
• A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays

This page was built for publication: Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines

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