Tabu Search Based Hybrid Meta-Heuristic Approaches for Schedule-Based Production Cost Minimization Problem for the Case of Cable Manufacturing Systems

This paper models and solves the scheduling problem of cable manufacturing industries that minimizes the total production cost, including processing, setup, and storing costs. Two hybrid meta-heuristics, which combine simulated annealing and variable neighbourhood search algorithms with tabu search...

Full description

Saved in:
Bibliographic Details
Published inInformatica (Vilnius, Lithuania) Vol. 33; no. 3; pp. 499 - 522
Main Authors Daneshdoost, Fereshteh, Hajiaghaei-Keshteli, Mostafa, Sahin, Ramazan, Niroomand, Sadegh
Format Journal Article
LanguageEnglish
Published London, England SAGE Publications 01.01.2022
IOS Press BV
Subjects
Online AccessGet full text
ISSN0868-4952
1822-8844
DOI10.15388/21-INFOR471

Cover

More Information
Summary:This paper models and solves the scheduling problem of cable manufacturing industries that minimizes the total production cost, including processing, setup, and storing costs. Two hybrid meta-heuristics, which combine simulated annealing and variable neighbourhood search algorithms with tabu search algorithm, are proposed. Applying some case-based theorems and rules, a special initial solution with optimal setup cost is obtained for the algorithms. The computational experiments, including parameter tuning and final experiments over the benchmarks obtained from a real cable manufacturing factory, show superiority of the combination of tabu search and simulated annealing comparing to the other proposed hybrid and classical meta-heuristics.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0868-4952
1822-8844
DOI:10.15388/21-INFOR471