A multi-level heuristic search algorithm for production scheduling
This paper introduces a multi-level heuristic search algorithm for identifying the optimal production schedule considering different levels of manufacturing requirements and constraints. The multi-level heuristic search algorithm generates search nodes at different levels. An upper level search node is composed of lower level search nodes, and evaluated based upon the evaluation of these lower level search nodes using a heuristic function. A production scheduling system was developed based upon the multi-level heuristic search algorithm. In this scheduling system, production requirements and constraints are represented at three different levels: task level, process level, and resource level. A task describes a manufacturing requirement. A process defines a method to achieve the goal of a task. A resource, such as a machine or a person, is a facility for accomplishing a required process. The multi-level heuristic search-based scheduling system was implemented using Smalltalk, an object-oriented programming language. Discussions on scheduling quality and efficiency are addressed at the end of this paper.
Document Type: Research Article
Affiliations: The University of Calgary
Publication date: 31 July 2000
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content