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. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable ne...

Flexible job-sop scheduling problem (FJSP) is based on the classical job-shop scheduling problem (JSP), however, it is even more harder than JSP because of the machine selection process in FJSP. In this paper, a particle swarm optimization (PSO) algorithm and a tabu search (TS) algorithm are integrated to solve the FJSP, the objective is to make the complete time minimum, i.e., to get the best ...

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

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

During last decades, developing multi-objective evolutionary algorithms for optimization problems has found considerable attention. Flexible job shop scheduling problem, as an important scheduling optimization problem, has found this attention too. However, most of the multi-objective algorithms that are developed for this problem use nonprofessional approaches. In another words, most of them c...

Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP) is a generalization of the above-mentioned problem, where each operation can be proces...

Flexible manufacturing systems are very complex to control and it is difficult to generate controlling systems for this problem domain. Flexible job-shop scheduling problem (FJSP) is one of the instances in this domain. It is a problemwhich inherits the job-shop scheduling problem (JSP) characteristics. FJSP has additional routing sub-problem in addition to JSP. In routing sub-problem each oper...

In this paper, we introduce a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO) algorithm, consisting of a combination of the Variable Neighborhood Search (VNS) and Particle Swarm Optimization(PSO). The proposed VNPSO algorithm is used for solving the multi-objective Flexible Job-shop Scheduling Problems (FJSP). Flexible job-shop scheduling is very important in...

0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.07.021 * Corresponding author. E-mail address: [email protected] (X. Shao). Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the monoobjective FJSP. However, they are very d...

Scheduling for the flexible job-shops has great importance in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization methods because of the high computational complexity. Considering several optimization criteria in this problem will bring on additional complexity and new pr...