A dynamic programming formulation for the one machine sequencing problem

DOI10.1016/0377-2217(78)90045-0MaRDI QIDQ1247907zbMATH OpenOpenAlexFDO

Authors P. J. Weeda

Publication date 1978

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(78)90045-0

Mathematics Subject Classification ID

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

Cites work

• A Dynamic Programming Approach to Sequencing Problems

Cited in

(5)

• Priority based fuzzy goal programming technique to fractional fuzzy goals using dynamic programming
• Solving large scale combinatorial optimization problems based on a divide and conquer strategy
• A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming
• A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming
• Optimized dead-zone inverse control using reinforcement learning and sliding-mode mechanism for a class of high-order nonlinear systems

This page was built for publication: A dynamic programming formulation for the one machine sequencing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247907)