A dynamic programming method for single machine scheduling
From MaRDI portal
Recommendations
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
- A dynamic programming algorithm for single machine scheduling with ready times
- Dynamic programming approach to the single-machine sequencing problem with different due-dates
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
Cites work
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A Dynamic Programming Approach to Sequencing Problems
- A decomposition algorithm for the single machine total tardiness problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Minimization of unsmooth functionals
- Minimizing Total Costs in One-Machine Scheduling
- State-space relaxation procedures for the computation of bounds to routing problems
Cited in
(26)- The use of dynamic programming in genetic algorithms for permutation problems
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
- An application of dynamic programming to assign pressing tanks at wineries
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Solving talent scheduling with dynamic programming
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Minmax scheduling with job-classes and earliness-tardiness costs
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Single machine scheduling with symmetric earliness and tardiness penalties
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- An algorithm for constructing single processor static-dynamic schedules
- An iterative dynamic programming approach for the temporal knapsack problem
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- An exact algorithm for single-machine scheduling without machine idle time
- Dynamic programming approach to the single-machine sequencing problem with different due-dates
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Exact approaches for solving a covering problem with capacitated subtrees
This page was built for publication: A dynamic programming method for single machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331548)
