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

@article{Baker1978FindingAO,
  title={Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks},
  author={Kenneth R. Baker and Linus Schrage},
  journal={Operations Research},
  year={1978},
  volume={26},
  pages={111-120}
}
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

Static scheduling research to minimize weighted and unweighted tardiness:A state-of-the-art survey

Tapan Sena, Joanne M. Suleka, Parthasarati Dileepanb
2003
View 7 Excerpts
Method Support
Highly Influenced

A Modified Binary Particle Swarm Optimization Algorithm for Permutation Flow Shop Problem

2007 International Conference on Machine Learning and Cybernetics • 2007
View 4 Excerpts
Highly Influenced

Efficient method for single machine total tardiness problem

2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI) • 2012

Transactions on Computational Collective Intelligence VIII

Lecture Notes in Computer Science • 2012
View 3 Excerpts

53 Citations

051015'82'89'97'05'13
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.