Show simple item record

dc.contributor.authorDengiz, B.en_US
dc.contributor.authorAlabaş-Uslu, Ç.en_US
dc.contributor.authorSabuncuoğlu, İhsanen_US
dc.coverage.spatialNashville, TN, USAen_US
dc.date.accessioned2016-02-08T11:34:39Z
dc.date.available2016-02-08T11:34:39Z
dc.date.issued2009en_US
dc.identifier.urihttp://hdl.handle.net/11693/26748
dc.descriptionDate of Conference: 2 April-30 March 2009en_US
dc.descriptionConference Name: IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009en_US
dc.description.abstractIn 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.en_US
dc.language.isoEnglishen_US
dc.source.titleProceedings of the IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/SCIS.2009.4927016en_US
dc.subjectExperimental studiesen_US
dc.subjectHigh-quality solutionsen_US
dc.subjectLocal searchen_US
dc.subjectLocal search heuristicen_US
dc.subjectMeta heuristicsen_US
dc.subjectMetaheuristicen_US
dc.subjectNp-completenessen_US
dc.subjectPerformance measureen_US
dc.subjectPermutation flow-shop schedulingen_US
dc.subjectRecord-to-record travelsen_US
dc.subjectResponse surfaceen_US
dc.subjectSearch processen_US
dc.subjectSelftuningen_US
dc.subjectComputational complexityen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectHeuristic methodsen_US
dc.subjectSimulated annealingen_US
dc.subjectTabu searchen_US
dc.subjectTuningen_US
dc.subjectProblem solvingen_US
dc.titleA local search heuristic with self-tuning parameter for permutation flow-shop scheduling problemen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.identifier.doi10.1109/SCIS.2009.4927016en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record