Scheduling is a series of activities aim of which is to assign jobs and/or resources to men and/or machines in production systems .
By performing these activities, it is targeted to minimize production time and costs, by providing information to a production system on what to make, when to make, with which staff, and on which machine .
Among many heuristic algorithms local search algorithms are reviewed in this section.
In local search, an initial configuration (valuation of variables) is generated and the algorithm moves from the current configuration to a neighborhood configurations until a solution (decision problems) or a good solution (optimization problems) has been found or the resources available are exhausted.
Usually, local search algorithms are called as greedy algorithms; since, they try to reach global maximum or minimum by searching the space locally.
Local search algorithms move from solution to solution in the space of candidate solutions (the search space) until a solution deemed optimal is found or a time bound is elapsed.
Aim of this paper is to apply tabu search in a textile manufacturing industry.
Specifically, fabric production is taken under consideration. In such systems, to produce fabric first raw strings are dyed. Afterwards, they are tied to conics and sent to fabric department to be weaved. Final stage is quality control and while controlling fabric, they are rolled on cylinders.