The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic app...

In this paper presents the hybrid algorithm using firefly and a cuckoo search algorithm for flexible open shop scheduling problem. The flexible, open shop scheduling is known to be NP-hard. Cuckoo algorithm (CA) is one of the widely used techniques for constrained optimization. And it gave the best results compared to other algorithms. A disadvantage of cuckoo algorithm though is that they easi...

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probab...

The flexibility present in a job shop is an important determinant of the future success of the shop, since it increases the ability to deal with the changes a job shop is faced with in a dynamic environment. The presence of idle-time in a job shop schedule contributes considerably to this flexibility. By introducing an anticipation factor that preserves idletime in the scheduling process more f...

We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For m = 2, we present a 32 -approximation algorithm, and for m = 3, we present a 12 7 -approximation algori...