A Novel Optimal Online Scheduling Scheme for Flexible Manufacturing Systems
نویسندگان
چکیده
منابع مشابه
Scheduling in Flexible Manufacturing Systems
One of the major problems confronting the search for efficiency in flexible manufacturing systems is the problem of loading and scheduling. This abstract presents a new method to solve such problems. The methodology, which is based on the use of genetic algorithms, allows simple codification of problems and thus facilitates its use. Two kinds of solution are proposed – that is, loading and sche...
متن کاملTardiness heuristic for scheduling Flexible Manufacturing Systems
This paper evaluates the tardiness performance of a complex dynamic manufacturing environment. These sampling-based adaptive heuristic in a dynamic manufacturing 'changes' include machine breakdowns, unavailability of environment. A test bed, following a real world manufacturing material and other resources to perform manufacturing system, has been developed. The proposed algorithm has been op...
متن کاملIntelligent Scheduling for Flexible Manufacturing Systems
A scheme for the scheduling of Flexible Manufacturing Systems (FMS) has been developed which integrates neural networks, parallel Monte-Carlo simulation, genetic algorithms. and machine learning. Modular neural networks are used to generate a small set of atlractive plans and schedules from a larger list of such plans and schedules. Parallel Monte-Carlo Simulation predicts rhe impact of each on...
متن کاملScheduling of flexible manufacturing systems using genetic algorithm: A heuristic approach
Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.10.002