نتایج جستجو برای: stochastic flexible flow shop
تعداد نتایج: 718558 فیلتر نتایج به سال:
This paper presents a fuzzy approach to capacitated flow shop scheduling problem. Fuzzy sets are applied to express the flexible constraints on capacity of each period in the scheduling horizon. Fuzzy sets are also used to model the processing times of jobs and the setup times of machines required when a new job starts processing. Demand is set for each period. Over production incurs the holdin...
In view of the difficulty of obtaining the optimal solution to the multi-objective scheduling of flexible job-shop by the general genetic algorithm, this paper takes into account the shortest processing time and the balanced use of machines, and puts forward the multi-population genetic algorithm based on the multi-objective scheduling of flexible job-shop. The method attempts to minimize the l...
This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop is the combination of Job Shop, Flow Shop and Open Shop scheduling problems. The sample i...
Paradigms in modern production are shifting and pose new demands for optimization techniques. The emergence of new, versatile, reconfigurable and networked machines enables flexible manufacturing scenarios which require, in particular, planning and scheduling methods for cyber-physical production systems to be flexible, reasonably fast, and anytime. This paper presents an approach to flexible j...
Due to the complicated circumstances in workshop, most of the conventional scheduling algorithms fail to meet the requirements of instantaneity, complexity, and dynamicity in job-shop scheduling problems. Compared with the static algorithms, dynamic scheduling algorithms can better fulfill the requirements in real situations. Considering that both flexibility and fuzzy processing time are commo...
An interesting research area is to solve scheduling problems using network flow models and algorithms. Most of the existing papers in this research area deal with scheduling problems with parallel machines (identical and / or uniform machines). This paper considers the specialized case and develops network flow models and algorithms to solve open shop and flow and job shop problems.
Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید