The majority of scheduling research assumes setup as negligible or part of the processing
time. While this assumption simplifies the analysis and/or reflects certain applications, it …

Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions
proposed are of hybrid construction cutting across the traditional disciplines. The problem …

Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

A hierarchical algorithm for the flexible job shop scheduling problem is described, based on
the tabu search metaheuristic. Hierarchical strategies have been proposed in the literature …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

We describe the main features of tabu search, emphasizing a perspective for guiding a user
to understand basic implementation principles for solving combinatorial or nonlinear …

Researchers and practitioners frequently spend more time fine-tuning algorithms than
designing and implementing them. This is particularly true when develo** heuristics and …

Personalized production has emerged as a result of the increasing customer demand for
more personalized products. Personalized production systems carry a greater amount of …

Genetic algorithms and tabu search have a number of significant differences. They also
have some common bonds, often unrecognized. We explore the nature of the connections …

Abstract The Travelling Salesman Problem (TSP) is an NP-hard problem with high number
of possible solutions. The complexity increases with the factorial of n nodes in each specific …