Showing papers on "Incremental heuristic search published in 1972"

Heuristic Algorithms for Multistage Flowshop Scheduling Problem

Abstract: This paper describes three heuristic algorithms for seeking a quick and near optimal solution to the n-job M-machine flowshop scheduling problem where jobs are processed on all machines in the same order, and the objective is to minimize either the mean flowtime or the maximum flowtime (make-span). The proposed heuristic algorithms are extensions of the heuristic rules of the author and are comparatively more effective in finding the optimal or near optimal solution to the problem. Computational experience pertaining to the effectiveness of proposed heuristic algorithms is discussed, indicating that the solutions obtained by proposed heuristic algorithms are compared to the Campbell-Dudek-Smith algorithm.

Preliminary report on a system for general space planning

Abstract: A computer language and a set of programs within that language are described which allow the formulating and solving of a class of space planning problems. The language is an extension of Algol and includes means to represent spaces and objects, to manipulate them, and to test the resulting arrangements according to a variety of constraints. The algorithms used to solve problems expressed in this language rely on heuristic programming. Both the language and the search algorithms are detailed.