Job sequencing with quadratic penalties. An a-based graph search approach

Document Type

Conference Proceeding

Publication Date

1-1-1993

Abstract

In minimum-penalty job sequencing on one machine, the epresentation of the search graph as a directed acyclic graph instead of as a tree can sometimes speed up execution times by a factor of over 25. This demonstrates the existence of Operations Research problems that can be solved faster by Algorithm A than by traditional branch-and-bound methods. Consider the best-first branch-and-bound procedure devised by Townsend in 1978 for optimal job sequencing on one machine with quadratic penalties, which still remains, with minor improvements, the only efficient way to solve that particular problem. A graph-based A formulation that uses Townsend's lower bounds at nodes as heuristic estimates runs many times faster, showing that the practical applicability of A is not limited to search graphs that are trees. It is surprising that such high speedups can be achieved even when the heuristic estimate function is consistent.

Identifier

0027307262 (Scopus)

ISBN

[0818638400]

Publication Title

Proceedings of the Conference on Artificial Intelligence Applications

First Page

190

Last Page

196

This document is currently not available here.

Share

COinS