An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
From MaRDI portal
Publication:2664413
Recommendations
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- An algorithm for minimizing setups in precedence constrained scheduling
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
Cites work
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
- A hybrid particle swarm optimization approach for the sequential ordering problem
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
- A note on the precedence-constrained class sequencing problem
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- An inexact algorithm for the sequential ordering problem
- Approximating Precedence-Constrained Single Machine Scheduling by Coloring
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- Branch-and-Bound Strategies for Dynamic Programming
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- Discrete optimization with decision diagrams
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- scientific article; zbMATH DE number 10435 (Why is no real title available?)
- Job shop scheduling with setup times, deadlines and precedence constraints
- Multivalued decision diagrams for sequencing problems
- Non-approximability of precedence-constrained sequencing to minimize setups.
- On the complexity of loop fusion
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with precedence constraints and setup times
- Routing Printed Circuit Cards Through an Assembly Cell
- Scheduling Problems and Mixed Graph Colorings
- Scheduling with batching: A review
- Single machine precedence constrained scheduling is a Vertex cover problem
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Solution methods for a scheduling problem with incompatibility and precedence constraints
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- The Transitive Reduction of a Directed Graph
This page was built for publication: An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664413)
