نتایج جستجو برای: scheduling dynamic flexible flow line simulation heuristics genetic programming
تعداد نتایج: 2599267 فیلتر نتایج به سال:
In project scheduling studies, to the best of our knowledge, hyper-heuristic collaborative is first-time applied with random activity durations. A based ensemble genetic programming (HH-EGP) method proposed for solving stochastic resource constrained problem (SRCPSP) by evolving an priority rules (PRs). The approach features (1) integrating critical path into resource-based policy class generat...
In this paper, Multi-objective Flexible dynamic Job shop scheduling with maintenance constraints is investigated. In the recent researches the single objective models were assessed. Whereas in competitive conditions, decision makers encountered with simultaneous multi-objective problems that could be conflict with each other. In this research, the objectives are makespan, mean flow time and m...
This paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...
ÐTask scheduling is essential for the proper functioning of parallel processor systems. Scheduling of tasks onto networks of parallel processors is an interesting problem that is well-defined and documented in the literature. However, most of the available techniques are based on heuristics that solve certain instances of the scheduling problem very efficiently and in reasonable amounts of time...
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
The control of an agile manufacturing system (AMS) is expected to be flexible, open, scalable and re-configurable so as to tackle the more complex and uncertain information flows. To meet these requirements, we propose agent-based control architecture for AMS, under which the functions of task planning, scheduling and dynamic control are integrated seamlessly. First of all, this paper introduce...
In this paper a complex scheduling problem in flexible manufacturing system (FMS) has been addressed with a novel approach called knowledge based genetic algorithm (KBGA). The literature review indicates that meta-heuristics may be used for combinatorial decision-making problem in FMS and simple genetic algorithm (SGA) is one of the meta-heuristics that has attracted many researchers. This nove...
abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...
This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید