A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications
In minimum-penalty job sequencing on one machine, the representation of the search graph as a directed acyclic graph instead of as a tree can sometimes s p d up execution times by a foctor of over 25. This demonstrates the existence of Operclrons Research problem that can be solved faster by Algorithm A* than by traditional branchand-bound methods. Consider the best-first branch-andbound procedure &ked by Townsend in 1978 for optimal job sequencing on one machine with quadratic penalties, whichdoi:10.1109/caia.1993.366611 fatcat:zidpp5fw7najhozqrl2lxjdtri