ADMISSIBLE HEURISTIC FUNCTIONS FOR FLOW-SHOP PROBLEMS

G.K. Winley and J.P.-O. Fan

References

  1. [1] R.W. Conway, W.L. Maxwell, & L.W. Miller, Theory ofscheduling (Reading, MA: Addison-Wesley, 1967).
  2. [2] J.P.O. Fan, Development and improvement of the SLA* three-machine flow-shop scheduling algorithm, Proc. IASTED Conf.on Artificial Intelligence and Applications, Scottsdale, AZ,2004, 495–500.
  3. [3] J.P.O. Fan, Solving the three-machine flow-shop schedulingproblem using intelligent search strategy, Proc. Int. Conf. onComputer, Communication and Control Technologies, Vol. 4,Orlando, FL, 2003, 287–292.
  4. [4] J.P.O. Fan, An intelligent heuristic search method for flow-shop problems, doctoral diss., University of Wollongong, Wollongong, Australia, 2002.
  5. [5] M.R. Zamani & L.Y. Shue, Developing an optimal learningsearch method for networks, Scientia Iranica, 2(3), 1995,197–206.
  6. [6] R. Zamani & L.Y. Shue, Solving project scheduling problemswith a heuristic learning algorithm, Journal of the OperationalResearch Society, 49(7), 1998, 709–716. doi:10.1038/sj.jors.2600546
  7. [7] M.R. Zamani, A high performance exact method for theresource-constrained project scheduling problem, Computersand Operations Research, 28, 2001, 1387–1401. doi:10.1016/S0305-0548(00)00048-4
  8. [8] R.E. Korf, Real-time heuristic search, Artificial Intelligence,16, 1990, 189–211. doi:10.1016/0004-3702(90)90054-4
  9. [9] S.V. Gheoweth & H.W. Davis, High performance A* searchusing rapidly growing heuristics, Proc. Int. Joint Conf. OnArtificial Intelligence, Sydney, Australia, 1991,198–203.
  10. [10] R.E. Korf, Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence, 2, 1985, 97–109. doi:10.1016/0004-3702(85)90084-0
  11. [11] R.E. Korf, Iterative-deepening A*; An optimal admissible treesearch, Proc. 9th Int. Joint Conf. on Artificial Intelligence,Los Angeles, CA, 1985, 1034–1036.
  12. [12] E. Ignall & L.E. Schrage, Application of the branch and boundtechnique to some flow-shop scheduling problems, OperationsResearch, 13(3), 1965, 400–412.
  13. [13] Z. Lomnicki, A branch and bound algorithm for the exactsolution of three-machine scheduling problem, OperationalResearch Quarterly, 16(1), 1965, 89–100.
  14. [14] C.B. McMahon & P.G. Burton, Flow-shop scheduling with thebranch and bound method, Operations Research, 15(3), 1967,473–481.

Important Links:

Go Back