Informatica

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.

Multicriteria sequencing problems with criteria ordered according to their importance are considered. Additional precedence and group technology constraints are imposed. We introduce a notion of a priority-generating vector function and suggest general techniques that form a base for the construction of polynomial time algorithms for numerous sequencing problems including all known polynomially solvable problems. A comprehensive survey of results for sequencing problems with ordered criteria is given as well.