Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
From MaRDI portal
Publication:4153908
Cited in
(22)- Solution of the single machine total tardiness problem
- Dynamic scheduling in manufacturing systems using Brownian approximations
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- A branch and bound procedure to minimize mean absolute lateness on a single processor
- A survey and evaluation of static flowshop scheduling heuristics
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
- Two-machine flowshop scheduling to minimize total tardiness
- Minimizing tardiness in a two-machine flow-shop
- Scheduling algorithms based on necessary optimality conditions
- Real-time scheduling of an automated manufacturing center
- Single machine scheduling with nonlinear cost functions
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Scheduling with tails and deadlines
- Hybrid algorithm for sequencing with bicriteria
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Production problems with deadline penalties
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing total tardiness in a scheduling problem with a learning effect
- One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit
- Decomposition of the single machine total tardiness problem
This page was built for publication: Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4153908)
