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

DOI10.1287/OPRE.26.1.111MaRDI QIDQ4153908zbMATH OpenOpenAlexFDO

Authors Kenneth R. Baker, Linus Schrage

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

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

Cited in

(23)

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

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)