نتایج جستجو برای: distributed permutation flow shops
تعداد نتایج: 753460 فیلتر نتایج به سال:
Background and purpose: Ëxposure to respirable particles (PM2.5) causes adverse health effects, such as: respiratory and cardiovascular diseases and eventually death. Çonsidering congested traffic flow in the city center of Sari, it could be expected that exposure of citizens to particulate air pollution would be high. The aim of this study was to survey the concentrations of PM2.5 indoor and o...
This paper deals with the problem of distributed job shop scheduling in which the classical single-facility job shop is extended to the multi-facility one. The mathematical formulation of the problem is comprehensively discussed. Two different mixed integer linear programming models in form of sequence and position based variables are proposed. Using commercial software of CPLEX, the small size...
This paper studies no-wait flowshop scheduling problems to minimize total tardiness. This paper mathematically formulates the problem as an effective mixed integer linear programming model. Moreover, this paper proposes solution methods based on variable neighborhood search and simulated annealing algorithms. Besides, some well-known heuristics of classical flow shops are adapted to the case of...
This paper considers a scheduling problem in flexible flow shops environment with the aim of minimizing two important criteria including makespan and cumulative tardiness of jobs. Since the proposed problem is known as an Np-hard problem in literature, we have to develop a meta-heuristic to solve it. We considered general structure of Genetic Algorithm (GA) and developed a new version of that b...
In this paper, we address the problem of production systems having two characteristics. First, the manufacturing times can be chosen between given bounds. Such a production system is said to have controllable processing times. Second, an operation must start as soon as the previous operation on the same part (if any) is completed. A production system having this characteristic is said to be no-...
This study intends to help manufacturers that use flexible job shops improve performance of due date assignment, that is, setting delivery times to jobs that arrive dynamically. High performing due date assignment enables achieving on-time delivery and quick response of delivery time to customer orders. Traditional methods for due date assignment are predefined equations that estimate the durat...
In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید