نتایج جستجو برای: scheduling algorithm

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

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

Journal: :Academic Medicine 1989

Journal: :journal of industrial engineering and management studies 0
m. zandieh department of industrial management, management and accounting faculty, shahid beheshti university, g. c., tehran, iran.

this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algor...

Journal: :journal of optimization in industrial engineering 2013
bahman naderi

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

Journal: :international journal of supply and operations management 0
masoud rabbani college of engineering, university of tehran, tehran, iran safoura famil alamdar university of tehran, tehran, iran parisa famil alamdar amir kabir university, tehran, iran

in this study, a two-objective mixed-integer linear programming model (milp) for multi-product re-entrant flow shop scheduling problem has been designed. as a result, two objectives are considered. one of them is maximization of the production rate and the other is the minimization of processing time. the system has m stations and can process several products in a moment. the re-entrant flow sho...

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

Journal: :international journal of industrial engineering and productional research- 0
m. mohammadi master student in department of industrial engineering, college of engineering, university of tehran, iran r. tavakkoli-moghaddam professor in department of industrial engineering, college of engineering, university of tehran, iran. a. ghodratnama ph.d. student in department of industrial engineering, college of engineering, university of tehran, iran. h. rostami student in department of industrial engineering, college of engineering, university of tabriz, iran

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

D. Gupta, P. Singla, S. Bala,

The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...

Amin-Naseri, , Mohammad Reza , Mokhtari, Hadi , Nakhai Kamal Abadi, Isa ,

  The project scheduling problem is known as a NP-hard problem in literature. In this research, a resource constrained project scheduling problem which is known as a NP-Hard problem is considered. This problem has attracted many researchers during recent years. The aim of this problem is to determine the optimal starting times of activities considering both precedence and available resources co...

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

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