A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem
2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
62 - 67
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/26748
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.
- Conference Paper 2294
Showing items related by title, author, creator and subject.
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs Erenay F.S.; Sabuncuoglu I.; Toptal, A.; Tiwari, M.K. (2010)We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is important in practice, as the former criterion ...
Gurel, S.; Akturk, M.S. (2008)In this study we attempt to deal with process planning, scheduling and preventive maintenance (PM) decisions, simultaneously. The objective is to minimize the total completion time of a set of jobs on a CNC machine. During ...
Cambazoglu, B.B.; Varol, E.; Kayaaslan, E.; Aykanat, C.; Baeza-Yates, R. (2010)Query forwarding is an important technique for preserving the result quality in distributed search engines where the index is geographically partitioned over multiple search sites. The key component in query forwarding is ...