Skip to main content
placeholder image

A heuristic search algorithm for flow-shop scheduling

Journal Article


Download full-text (Open Access)

Abstract


  • This article describes the development of a new intelligent heuristic search algorithm (IHSA*) which guarantees an optimal solution for flow-shop problems with an arbitrary number of jobs and machines

    provided the job sequence is constrained to be the same on each machine. The development is described in terms of 3 modifications made to the initial version of IHSA*. The first modification concerns the

    choice of an admissible heuristic function. The second concerns the calculation of heuristic estimates as the search for an optimal solution progresses, and the third determines multiple optimal solutions when

    they exist. The first 2 modifications improve performance characteristics of the algorithm and experimental evidence of these improvements is presented as well as instructive examples which illustrate the use of initial and final versions of IHSA*.

UOW Authors


  •   Fan, Joshua
  •   Winley, Graham K. (external author)

Publication Date


  • 2008

Citation


  • Fan, J. P. & Winley, G. K. (2008). A heuristic search algorithm for flow-shop scheduling. Informatica: journal of computing and informatics, 32 (4), 453-464.

Scopus Eid


  • 2-s2.0-57349154329

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1070&context=gsbpapers

Ro Metadata Url


  • http://ro.uow.edu.au/gsbpapers/68

Number Of Pages


  • 11

Start Page


  • 453

End Page


  • 464

Volume


  • 32

Issue


  • 4

Place Of Publication


  • http://www.informatica.si/vol32.htm#No4

Abstract


  • This article describes the development of a new intelligent heuristic search algorithm (IHSA*) which guarantees an optimal solution for flow-shop problems with an arbitrary number of jobs and machines

    provided the job sequence is constrained to be the same on each machine. The development is described in terms of 3 modifications made to the initial version of IHSA*. The first modification concerns the

    choice of an admissible heuristic function. The second concerns the calculation of heuristic estimates as the search for an optimal solution progresses, and the third determines multiple optimal solutions when

    they exist. The first 2 modifications improve performance characteristics of the algorithm and experimental evidence of these improvements is presented as well as instructive examples which illustrate the use of initial and final versions of IHSA*.

UOW Authors


  •   Fan, Joshua
  •   Winley, Graham K. (external author)

Publication Date


  • 2008

Citation


  • Fan, J. P. & Winley, G. K. (2008). A heuristic search algorithm for flow-shop scheduling. Informatica: journal of computing and informatics, 32 (4), 453-464.

Scopus Eid


  • 2-s2.0-57349154329

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1070&context=gsbpapers

Ro Metadata Url


  • http://ro.uow.edu.au/gsbpapers/68

Number Of Pages


  • 11

Start Page


  • 453

End Page


  • 464

Volume


  • 32

Issue


  • 4

Place Of Publication


  • http://www.informatica.si/vol32.htm#No4