This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...