نتایج جستجو برای: makespan
تعداد نتایج: 2819 فیلتر نتایج به سال:
ABSTRACT During the shipbuilding process, a block assembly line suffers bottleneck when largest amount of material is processed. Therefore, scheduling optimization important for productivity. Currently, sequence inbound products controlled by determining input using heuristic or metaheuristic approach. However, algorithm has limitations in that computation time increases exponentially as number...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
An Efficient Max-Min Resource Allocator and Task Scheduling Algorithm in Cloud Computing Environment
Cloud computing is a new archetype that provides dynamic computing services to cloud users through the support of datacenters that employs the services of datacenter brokers which discover resources and assign them Virtually. The focus of this research is to efficiently optimize resource allocation in the cloud by exploiting the Max-Min scheduling algorithm and enhancing it to increase efficien...
The most common objective function of task scheduling problems is makespan. However, on a computational grid, the 2nd optimal makespan may be much longer than the optimal makespan because the speed of each processor of a grid varies over time. So, if the performance measure is makespan, there is no approximation algorithm in general for scheduling onto a grid. In contrast, recently the authors ...
This article describes the heuristics used by Shadoks 1 team for CG:SHOP 2021 challenge. year’s problem is to coordinate motion of multiple robots in order reach their targets without collisions and minimizing makespan. It a classical multi-agent path finding with specificity that instances are highly dense an unbounded grid. Using outlined this article, our won first place best solution 202 ou...
The tremendous expansion of the Internet Things (IoTs) has generated an enormous volume near and remote sensing data, which is increasing with emergence new solutions for sustainable environments. Cloud computing typically used to help resource-constrained IoT devices. However, cloud servers are placed deep within core network, a long way from IoT, introducing immense data transactions. These t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید