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

DOI10.1287/opre.26.1.111zbMath0376.90055OpenAlexW2100500633MaRDI QIDQ4153908

Linus Schrage, Kenneth R. Baker

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.1.111

Mathematics Subject Classification ID

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

Related Items

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