Single machine scheduling with precedence constraints and bounded maximum delay value
From MaRDI portal
Cites work
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- A decomposition theorem for partially ordered sets
- A note on scheduling identical coupled tasks in logarithmic time
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- Bin packing with fixed number of bins revisited
- Complexity Results for Bandwidth Minimization
- Coupled task scheduling with exact delays: literature review and models
- Deterministic Scheduling with Pipelined Processors
- On Some Variants of the Bandwidth Minimization Problem
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- On the space and circuit complexity of parameterized problems: classes and completeness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
- Parameterized complexity of a coupled-task scheduling problem
- Parameterized complexity of a parallel machine scheduling problem
- Parameterized complexity of machine scheduling: 15 open problems
- Parameterized problems complete for nondeterministic FPT time and logarithmic space
- Relationships between nondeterministic and deterministic tape complexities
- Scheduling coupled tasks with exact delays for minimum total job completion time
- Single machine scheduling subject to precedence delays
- Single-machine scheduling with release times, deadlines, setup times, and rejection
This page was built for publication: Single machine scheduling with precedence constraints and bounded maximum delay value
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232806)
