We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...

This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach ...

Since their introduction, local search algorithms – and in particular tabu search algorithms – have consistently represented the state-of-the-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a...

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...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...