Abstract—One type of scheduling problems found in the area of textile industry is the Flow Shop Scheduling Problem (FSSP). The solution of this problem is the sequence of jobs that meet certain requirements. In practice, dispatching rules are often used to determine the order of jobs. This paper proposes a new approach in finding solutions for FSSP. The proposed method applies a tabu-search based hyper-heuristic approach. Hyper-heuristic can be used to combine several basic heuristics to obtain a solution. By using four dispatching rules as the basic heuristics, i.e. FIFO, LIFO, SPT, and LPT, the proposed method, TSHH, has been implemented in a computer program. In order to measure the performance of TSHH, several experiments have been conducted by using Taillard's benchmark datasets. The conclusion obtained is that with a proper heuristics combination and value tenure, TSHH is able to produce better solutions than the solutions of four dispatching rules.

Index Terms—flow shop scheduling problem, dispatching rules, tabu-search, hyper-heuristics

Cite: Cecilia E. Nugraheni and Luciana Abednego, "A Tabu-Search Based Constructive Hyper-heuristics for Scheduling Problems in Textile Industry," Journal of Industrial and Intelligent Information, Vol. 5, No. 2, pp. 23-27, December 2017. doi: 10.18178/jiii.5.2.23-27