A dynamic programming formulation for the one machine sequencing problem

DOI10.1016/0377-2217(78)90045-0zbMath0381.90054OpenAlexW2014999269MaRDI QIDQ1247907

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)

Related Items (4)

Priority based fuzzy goal programming technique to fractional fuzzy goals using dynamic programming ⋮ A Goal Programming Method for Solving Fractional Programming Problems via 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

Cites Work

• A Dynamic Programming Approach to Sequencing Problems

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