نتایج جستجو برای: sequencing and scheduling

تعداد نتایج: 16856732  

Journal: :مهندسی برق و الکترونیک ایران 0
m. pourakbari-kasmaei m. rashidi-nejad s. piltan

this paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. a modified objective function associated with a new start-up cost term is introduced in this paper. the proposed method is used to solve generating scheduling problem satisfying srr, minimum up and down time as well as ramp rate constraints. two case studies are conducted to implem...

Journal: :Electronics 2021

The Internet of Medical Things (IoMT) workflow applications have been rapidly growing in practice. These internet-based can run on the distributed healthcare sensing system, which combines mobile computing, edge computing and cloud computing. Offloading scheduling are required methods network. However, a security issue exists it is hard to different types tasks (e.g., security, delay-sensitive,...

Mehdy Morady Gohareh Naser Shams Gharneh Reza Ghasemy Yaghin

The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum av...

Journal: :journal of advances in computer research 0
mona torabi college of computer science, tabari university of babol, iran

in this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. scheduling algorithms play an important role in grid computing, parallel tasks scheduling and sending them to appr...

2009
Chae Y. Lee

A single machine n-job scheduling problem is examined to minimize sum of absolute deviations of completion times from a common due date. Simple and hybrid genetic Algorithms are developed by investigating basic operators for the applications of job sequencing problems. For the simple genetic algorithm two heuristic crossover schemes: Algorithm VASX and Algorithm VADX are developed based on impo...

2003
Shao-hua Zhang Yu-jin Wu Ning Gu Wei Wang

As the complexity of Grid applications increase, it becomes more important and urgent to provide grid workflow to construct and manage the applications. The grid workflow based on dynamic scheduling and performance evaluation is presented in this paper according to the standards of GCC and WFMC, which consists of user portal, resource management component, grid services management, performance ...

Journal: :genetics in the 3rd millennium 0
hossein najmabadi mojgan babanejad maryam beheshtian fariba ardalani hossein daghagh nooshin nikzat

hearing loss (hl) is the most common communication disorder affecting about 1/1000 births worldwide caused by environmental or genetic factors. about 30-50% is attributed to genetic factors and till now more than 85 genes have been implicated in non-syndromic hl. in iran, hl is second to intellectual disability as the most common disability, affecting 1 of every 166 persons. about 15 years ago ...

Journal: :Computers & Industrial Engineering 2008
Burak Eksioglu Sandra Duni Eksioglu Pramod Jain

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a ...

Journal: :Manufacturing & Service Operations Management 2007
Yossi Bukchin Eran Hanany

D organizations may incur inefficiencies because of scheduling issues associated with competition among decision makers (DMs) for limited resources. We analyze the decentralization cost (DC), i.e., the ratio between the Nash equilibrium cost and the cost attained at the centralized optimum. Solution properties of a dispatching-sequencing model are derived and subsequently used to develop bounds...

2012
Zohreh Davarzani Nima Khairdoost

Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید