This paper describes the development of an intelligent search strategy for solving the three-machine flow-shop scheduling problem. The method involved is based on a heuristic search algorithm SLA~* (Search and Learning A~*) which was derived and improved from the IDA~* (Iterative Deepening A~*) algorithm developed by Korf in 1985. In addition to solving the three-machine flow-shop scheduling problem, we have also developed two improvements. The first is related to the calculation of heuristic estimates during the search process for flow-shop scheduling problems, and the second is an unproved heuristic function for the calculation of the initial heuristic estimates at the beginning of the search process for three-machine problems. This algorithm will be suitable for many industrial problems especially in production scheduling and logistics.
展开▼
