In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

This research introduces three heuristic algorithms for solving job-shop scheduling problems, job-shop scheduling problems with multi-purpose machines, and open-shop scheduling problems. All these algorithms are based on the particle swarm optimization algorithm, and generate solutions that belong to the class of parameterized active schedules via their specific decoding procedures. Comparison ...

In this paper a new neuro-genetic architecture is presented that solves a profit oriented dynamic job shop problem. In the job shop order acceptance and scheduling problem new jobs arrive continuously and because of insufficient job shop capacity, a selection has to be made among the offered jobs. The goal is to find an order acceptance policy, which is supported by a scheduling policy, that ma...

Typically, general job shop scheduling problems assume that working times of machines are equal, for instance eight hours a day. However, in real factories, these working times are different because the machines may have different processing speeds, or they may require maintenance. That is, one machine may need to be operated only half day whereas other machines may have to be operated for the ...

In our recent research, we showed results of the comparative study on effects of using several kinds of scheduling evaluation criteria as the fitness function of a genetic algorithm for job-shop scheduling. From these results, we obtained that the idle time criterion sometimes can provide a good makespan-minimizing schedule for a job-shop scheduling problem. In this paper, according to the abov...

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on attribute oriented mining technique to solve the multi-ob...

The job-shop scheduling problem has attracted many researchers’ attention in the past few decades, and many algorithms based on heuristic algorithms, genetic algorithms, and particle swarm optimization algorithms have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. In this paper, a new hybrid swarm intelligence algorithm consists of par...

The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the propos...

This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better transmit temporal relationships in the schedule. The approach produced excellent results on standard benchmark job shop scheduling problems. We further tested many models and scales of parallel GAs in the context of job shop...