نتایج جستجو برای: no wait hybrid flowshop scheduling

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی امیرکبیر(پلی تکنیک تهران) - دانشکده مهندسی برق 1386

مساله hybrid flowshop یک مساله زمانبندی است که پروسه تولید در آن شامل چندین مرحله است، که هریک دارای چندین ماشین موازی است و همه کارها یک مسیر پروسس یکسانی را طی می کنند. ما یک مساله با ماشینهای موازی یکسان را مطالعه می کنیم. مساله hybrid flowshop در طیف گسترده ای از پروسه های صنعتی مانند صنایع فولادسازی، شیمیایی، پتروشیمی استفاده می شود. به عنوان یک مثال، ما جریان تولید فولاد در مجتمع فولاد مب...

2011
Xiaohui Li Hicham Chehade Farouk Yalaoui Lionel Amodeo

In this paper, we have studied a multiobjective hybrid flowshop scheduling problem where n independent jobs should be executed in a hybrid assembly line. The aim of our work is to optimize the makespan and the total tardiness of the whole production. A simulation based optimization algorithm is proposed here to solve this problem. It is a combination of the simulation software ARENA and the FLC...

Journal: :Mathematics 2022

Energy conservation, emission reduction, and green low carbon are of great significance to sustainable development, also the theme transformation upgrading manufacturing industry. This paper concentrates on studying energy-efficient hybrid flowshop scheduling problem with consistent sublots (HFSP_ECS) objective minimizing energy consumption. To solve problem, HFSP_ECS is decomposed by idea “div...

Journal: :Computers & OR 2005
Samuel Guirchoun Patrick Martineau Jean-Charles Billaut

The context of the problem tackled in this paper is a computer system composed by a single server and two identical parallel machines. The processing times on the server are assumed to be unary and the objective is to minimize the total completion time. The papers dealing with scheduling problems with a server generally consider that the setup activities require simultaneously the server and th...

2014
Ewa Figielska

The paper addresses the problem of scheduling in the two-stage flowshop with parallel unrelated machines and renewable resource constraints. The objective is minimization of makespan. The problem is NP-hard. Fast heuristic algorithms using list scheduling and greedy strategies are proposed. For evaluation of the performance of the algorithms computational experiments are performed on randomly g...

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

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