Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Hamilton-Jacobi theories (49L99)

Cited In (22)

Scheduling with tails and deadlines
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
A survey and evaluation of static flowshop scheduling heuristics
Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
Minimizing total tardiness in a scheduling problem with a learning effect
Scheduling algorithms based on necessary optimality conditions
Production problems with deadline penalties
A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
Hybrid algorithm for sequencing with bicriteria
Two-machine flowshop scheduling to minimize total tardiness
Decomposition of the single machine total tardiness problem
Single machine scheduling with nonlinear cost functions
Real-time scheduling of an automated manufacturing center
Analysis of a linearization heuristic for single-machine scheduling to maximize profit
Minimizing tardiness in a two-machine flow-shop
The stochastic single machine scheduling problem with earliness and tardiness costs
A branch and bound procedure to minimize mean absolute lateness on a single processor
A decomposition algorithm for the single machine total tardiness problem
Dynamic scheduling in manufacturing systems using Brownian approximations
Solution of the single machine total tardiness problem
An exact algorithm for the precedence-constrained single-machine scheduling problem
One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons

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)