نتایج جستجو برای: wait flow shop

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

Journal: :journal of optimization in industrial engineering 0
mahdi eghbali qazvin azad university mohammad saidi mehrabad department of industrial engineering, iran university of science and technology, narmak, tehran, iran hassan haleh islamic azad university, qazvin branch, department of industrial and mechanical engineering, qazvin, iran

scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...

2014
Dominik ŻELAZNY

In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...

Journal: :J. Scheduling 2008
Arantza Estévez-Fernández Manuel A. Mosquera Peter Borm Herbert Hamers

In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines. By identifying jobs with agents whose costs linearly depend on the completion time of their jobs and assuming an initial processing order on the jobs, we face two problems: the first is how to obtain an optimal order that minim...

Journal: :international journal of industrial engineering and productional research- 0
danial khorasanian iut ghasem moslehi iut

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

Journal: :Future Internet 2017
Ahmed R. Sadik Bodo Urban

This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines sequentially. Flow shop scheduling tries to find the appropriate solution to optimize the sequence order of this group of jobs over the existi...

2002
Kambiz Farahmand Arun Balasubramanian

A discrete event simulation model was developed to study the flow of material and product in a shop floor. It uses real time data available from a job shop sole dedicated to noncommercial contracts and as such deals with very seasonal demand. The objective of this model is to provide the shop with a decision support tool that will assist in evaluating the movement of products throughout the sho...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس 1378

مسئله تعیین توالی مجموعه ای از کارها با معیار کمینه سازی مجموع بیشینه های زودکرد و دیرکرد مورد بررسی قرار گرفته است . این معیار به دلیل سعی در حداقل کردن و به صفر رساندن مقادیر زودکرد و دیر کردار، منطبق بر سیستمهای تولیدی مختلفی از جمله jit می باشد. این معیار در مسائل یک ماشین و n کار (n/1/et max) و مسائل m ماشین و n کار با حالت flow shop، (n/m/p/et max) مورد بررسی قرار گرفته است . حالتهای خاص ...

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

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