An algorithm for the single machine sequencing problem with precedence constraints
From MaRDI portal
Cited in
(20)- Single machine precedence constrained scheduling is a Vertex cover problem
- On the approximability of average completion time scheduling under precedence constraints.
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
- Time-critical testing and search problems
- Risk-averse single machine scheduling: complexity and approximation
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Designing PTASs for MIN-SUM scheduling problems
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Vertex cover in graphs with locally few colors
- Approximating Single Machine Scheduling with Scenarios
- A heuristic hybrid framework for vector job scheduling
- Exact and Approximation Algorithms for the Expanding Search Problem
- Minimizing the total weighted duration of courses in a single machine problem with precedence constraints
- Sequential testing in sparse precedence networks
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
This page was built for publication: An algorithm for the single machine sequencing problem with precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883868)
