نتایج جستجو برای: stochastic flexible flow shop
تعداد نتایج: 718558 فیلتر نتایج به سال:
Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach
In this paper, an efficient algorithm is presented to solve flexible flow-shop problems using fuzzy approach. The goal is to minimize the total job tardiness. We assume parallel machines with different operation times. In this algorithm, parameters like ‘‘due date’’ and ‘‘operation time’’ follow a triangular fuzzy number. We used data mining technique as a facilitator to help in finding a bette...
In this talk a self-adaptive, swarm-based control model for real-time part routing in a flexible flow shop environment is presented.. The proposed control model is a multi-agent system that exhibits adaptive behaviour, which has been inspired from the natural system of the wasp colony. The production problem, which was first introduced by Morley et al. (Morley and Schelberg 1993, Morley 1996, M...
The flexible flow-shop group scheduling problem is investigated in this paper to minimize the makespan. Two algorithms have been proposed to solve the problem with two machine centers, which have the same number of parallel machines. The first one is a heuristic algorithm. It first determines the sequence of jobs in each group by Sriskandarajah and Sethi’s approach of solving the flexible flow-...
This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The cas...
In this paper, we propose a water flow algorithm for solving flexible flow shop scheduling problem with limited intermediate buffers, which is a NP-hard problem encountered in industry. The proposed algorithm is inspired by the hydrological cycle in meteorology and the erosion phenomenon in nature. In the algorithm, we combine the amount of precipitation and its falling force to form a flexible...
In this paper, Multi-Objective Flexible Job-Shop scheduling with Parallel Machines in Dynamic manufacturing environment (MO-FDJSPM) is investigated. Moreover considering dynamical job-shop environment (jobs arrived in non-zero time), It contains two kinds of flexibility which is effective for improving operational manufacturing systems. The non-flexibility leads to scheduling program which have...
We study the problem of minimizing the makespan in a two-stage assembly flow shop scheduling problem with uniform parallel machines. This problem is a generalization of the assembly flow shop problem with concurrent operations in the first stage and a single assembly operation in the second stage. We propose a heuristic with an absolute performance bound which becomes asymptotically optimal as ...
Today’s industries need more flexible scheduling systems able to produce new valid schedule in response to the modifications concerning orders, production processes and deliveries of materials. This paper introduces a multi-agent system applied to a job shop dynamic scheduling problem in which new production orders or deliveries arrive continuously and affect the already scheduled plan. We have...
Today’s industries need more flexible scheduling systems able to produce new valid schedule in response to the modifications concerning orders, production processes and deliveries of materials. This paper introduces a multi-agent system applied to a job shop dynamic scheduling problem in which new production orders or deliveries arrive continuously and affect the already scheduled plan. We have...
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into variable search for solving the permutation flow-shop scheduling problem. The first constructs as seed using recursive application of extended two-machine In this method, jobs are recursively decomposed two separate groups, and, each group, optimal is calculated based on Then over...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید