A Search Method For Flowshop Scheduling Problem

Mohd Sairuzuan, Mohd Rashid (2006) A Search Method For Flowshop Scheduling Problem. Project Report. UTeM, Melaka, Malaysia. (Submitted)

	PDF (24 Pages) A_Search_Method_For_Flowshop_Scheduling_Problem.pdf - Submitted Version Download (261kB)
	PDF (Full Text) A_Search_Method_For_Flowshop_Scheduling_Problem.pdf - Submitted Version Restricted to Registered users only Download (777kB)

Abstract

Search method is one of the approaches that had been considered important in improving the job completion time in the flowshop scheduling. There are many methods available to obtain such solutions, including constructive heuristics, search methods and enumeration. Search method is much better compare to the enumeration technique and constructive heuristics because this technique is suitable for large size problems and gives good results without depending on the structure of the algorithms and the structure of the problems. In this study, analysis will be develop base on the search method to solve the scheduling problem (minimize the makespan).

Actions (login required)

View Item