A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem

In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these heuristics are quite effective to solve the problem, they suffer from the need to optimize parameters. The proposed heuristic, named STLS, has a single self-tuning parameter which is calculated and updated dynamically based on both the response surface information of the problem field and the performance measure of the method throughout the search process. Especially, application simplicity of the algorithm is attractive for the users. Results of the experimental study show that STLS generates high quality solutions and outperforms the basic tabu search, simulated annealing, and record-to-record travel algorithms which are well-known local search based metaheuristics.

[1]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[3]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[4]  G. Dueck.  New optimization heuristics , 1993 .

[5]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[6]  Jian Ma,et al.  Theory and Methodology Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property : An investigation of generation mechanism , 1997 .

[7]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[8]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[9]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[10]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[11]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..