A job-shop scheduling problem is one of the classic scheduling problems considered to be NP-hard. In this paper, we presenta modified adaptiveevolutionary algorithm (EA) that uses speculative mutations, variable fitness functions and a pseudo-random number generator for solving job-shop scheduling problems. The algorithm was tested on well-known benchmark datainstances, such as Ft10, La01, Swv0...

Job shop scheduling(JSS) is a hard problem with most of the research focused on scenarios with the assumption that the shop parameters such as processing times, due dates are constant. But in the real world uncertainty in such parameters is a major issue. In this work, we investigate a genetic programming based hyper-heuristic approach to evolving dispatching rules suitable for dynamic job shop...

Job shop scheduling problems play an important role in both manufacturing systems and industrial process for improving the utilization of resources, and therefore it is crucial to develop efficient scheduling technologies. The Job shop scheduling problem, one of the best known production scheduling problems, has been proved to be NP-hard. In this paper, we present a parallel and agent-based loc...

The optimization of job-shop scheduling is very important because of its theoretical and practical significance. In this paper, a computationally effective approach of combining bacterial foraging strategy with particle swarm optimization for solving the minimum makespan problem of job shop scheduling is proposed. In the artificial bacterial foraging system, a novel chemotactic model is designe...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

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

The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job mmachine problem is known to be NP hard problem, several meta heuristics have been applied so far in the...

In the last decade, various approximation approaches, such as dispatching rules, shifting bottleneck heuristic and local search methods, are proposed for the job shop scheduling problem. As one of the local search methods, taboo search provides a promising alternative for the job shop scheduling problem; however, it has to be tailored each time with respect to parameters for every instance in o...

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 finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. We propose ...

The job shop scheduling problem is one of the most arduous combinatorial optimization problems. Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. This paper proposed a new effective approach based on the hybridization of the particle swarm optimization (PSO) an...