Solving Distributed Flexible Manufacturing Systems Scheduling Problems Subject to Maintenance: Memetic Algorithms Approach

2009 ◽  
Author(s):  
Mehdi Yadollahi ◽  
Amir Masoud Rahmani
Keyword(s):  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Memetic Algorithms ◽  
Scheduling Problems

Scheduling Problems of Flexible Manufacturing Systems: Review, Classification and Opportunities

2016 ◽  
Vol 26 ◽  
pp. 142-160 ◽  
Author(s):  
Ghita Lebbar ◽  
Abdellah El Barkany ◽  
Abdelouahhab Jabri
Keyword(s):  
Comparative Analysis ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Optimal Solution ◽  
Type Systems ◽  
Scheduling Problems ◽  
Hybrid Flowshop ◽  
Calculation Time

This paper will relate initially to the scheduling characteristics of flexible manufacturing systems, and more specifically, the scheduling problems in flowshop and hybrid flowshop type systems representing interesting structures for the modeling of several problems resulting from the industrial world. Subsequently, we will focus our attention on the principal methods for solving scheduling problems, while presenting in the following the main published works for the aforementioned systems. Lastly, a comparative analysis will be carried out to highlight the fundamental ideas leading to the adoption of an effective approach capable of producing an optimal solution in a reasonable calculation time.

Scheduling in Flexible Manufacturing Systems

2018 ◽  
pp. 1-19
Author(s):  
Fraj Naifar ◽  
Mariem Gzara ◽  
Taicir Loukil Moalla
Keyword(s):  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Computation Time ◽  
Flexible Job Shop ◽  
Scheduling Problems ◽  
Genetic Operators ◽  
Flexible Job Shop Problem

Flexible manufacturing systems have many advantages like adaptation to changes and reduction of lateness. But flexible machines are expensive. The scheduling is a central functionality in manufacturing systems. Optimizing the job routing through the system, while taking advantage from the flexibility of the machines, aims at improving the system's profitability. The introduction of the flexibility defines a variant of the scheduling problems known as flexible job shop scheduling. This variant is more difficult than the classical job shop since two sub-problems are to be solved the assignment and the routing. To guarantee the generation of efficient schedules in reasonable computation time, the metaheuristic approach is largely explored. Particularly, much research has addressed the resolution of the flexible job shop problem by genetic algorithms. This chapter presents the different adaptations of the genetic scheme to the flexible job shop problem. The solution encodings and the genetic operators are presented and illustrated by examples.

Sign in / Sign up

Export Citation Format

Share Document