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 (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. It is quite difficult to achieve optimal or near-optimal solutions with single traditional optimization approach because the multi objective FJSP has the high computational complexity. An novel hybrid algorithm ...

Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. This paper proposes a parallel variable neighborhood search (PVNS)...

This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times (SDSTFJSP). This is an extension of the classical job shop scheduling problem with many applications in real production environments. We propose an effective neighborhood structure for the problem, including feasibility and non improving conditions, as well as procedures for fast neighbor estimatio...

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

Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each m...

While manufacturing industry facing tough market competition, quickly responsive and flexible Job-Shop Scheduling System, JSSS, seems more attractive in nowadays. Research and applications on JSSS were summarized in this paper. A new framework of JSSS was designed in our research. A synthetic method was used here in order for efficiency and practicality. We took advantage of Multi-Agent System ...

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

We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that forms a feasible solution of the shortest path problem, and to execute the selected jobs on the open (or job) shop machines to minimi...

In most real production environment, schedules are usually inevitable with the presence of a variety of unexpected disruptions. Thus it is necessary to develop predictive/reactive schedules which can absorb disruptions while maintaining high shop performance. In this paper, a robust predictive/reactive scheduling method is developed for solving job shop scheduling in dynamic environment. It con...