The production of bakery goods is strictly time sensitive due to the complex biochemical processes during dough fermentation, which leads to special requirements for production planning and scheduling. Instead of mathematical methods scheduling is often completely based on the practical experience of the responsible employees in bakeries. This sometimes inconsiderate scheduling approach often l...

In this paper a new metaheuristic method is proposed to solve the classical permutation flowshop scheduling problem with the objective of minimizing sum of completion times. The representative neighbourhood combines the stochastic sampling method mainly used in Simulated Annealing and the best descent method elaborated in Tabu Search and integrates them naturally into a single method. The metho...

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a ...

This paper examines how the search ability of evolutionary multi-objective optimization (EMO) algorithms can be improved by the hybridization with local search through computational experiments on multi-objective permutation flowshop scheduling problems. The task of EMO algorithms is to find a variety of nondominated solutions of multi-objective optimization problems. First we describe our mult...

This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than 2/3.

Production environment in modern industries, like integrated circuits manufacturing, fiberglass processing, steelmaking, and ceramic frit, is characterized by zero idle-time between inbound outbound jobs on every machine; this technical requirement improves energy efficiency, hence, has implications for cleaner production other situations. An exhaustive review of literature first conducted to s...