Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …

In this work we present a review and comparative evaluation of heuristics and
metaheuristics for the well-known permutation flowshop problem with the makespan …

Flow shop scheduling (FSS) problem constitutes a major part of production planning in
every manufacturing organization. It aims at determining the optimal sequence of processing …

Wire rod and bar rolling is an important batch production process in steel production
systems. A scheduling problem originated from this process is studied in this work by …

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 …

The vehicle routing problem (VRP) under capacity and distance restrictions involves the
design of a set of minimum cost delivery routes, originating and terminating at a central …

Over the last decade, many metaheuristics have been applied to the flowshop scheduling
problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques …

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 propose a hybrid algorithm for finding a set of nondominated solutions of a multi
objective optimization problem. In the proposed algorithm, a local search procedure is …

This paper combines the tabu search process with a genetic algorithm by employing a new
partial opposed-based as the population initialization technique to minimize makespan …