A Trainable Heuristic Procedure for the Assembly Line Balancing Problem
Authors:
- Jack ByrdJBJack Byrd
- 1 June 1976
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 8 (2) , 195-201
Abstract
This paper examines the development of a solution procedure for many types of combinatorial problems. The technique known as the trainable heuristic procedure uses algorithmic procedures to gain experience on heuristic approaches to combinatorial problems. The synergistic combination of these approaches leads to a learning mechanism which has proven very effective in the solution of the assembly line balancing problem.Keywords
This publication has 3 references indexed in Scilit:
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954