In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

Scheduling problems should not only focus on minimizing completion time, but other performances, such as energy consumption, are urgent to investigate. Many companies and researchers competing develop various methods solve this problem. One problem that has received much attention lately is the energy-efficient Hybrid Flow Shop Problem (HFSP). The HFSP also popularly called flexible flow shop T...

During the last decades, hundreds of approximate algorithms have been proposed in literature addressing flow-shop-based scheduling problems. In race for finding best proposals to solve these problems, speed-up procedures compute objective functions represent a key factor efficiency algorithms. This is case well-known Taillard’s accelerations traditional flow shop with makespan minimisation or s...

The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we sh...