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

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

Journal: :Polibits 2016
Nouri Nouha Talel Ladhari

We propose in this paper a Blocking Iterated Greedy algorithm (BIG) which makes an adjustment between two relevant destruction and construction stages to solve the blocking flow shop scheduling problem and minimize the maximum completion time (makespan). The greedy algorithm starts from an initial solution generated based on some well-known heuristic. Then, solutions are enhanced till some stop...

Journal: :European Journal of Operational Research 2005
Ameur Soukhal Ammar Oulamara Patrick Martineau

In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as Automated Guided Vehicles, robots and conveyors, and finished jobs are delivered to warehouses or customers by vehicles such as trucks. This paper investigates two-machine flow shop scheduling problems taking transportation into account. The finished...

Journal: :روش های عددی در مهندسی (استقلال) 0
عزیزاله معماریانی و قاسم مصلحی a. memariani g. moslehi

flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

Journal: :journal of optimization in industrial engineering 2010
jafar razmi reza tavakoli moghaddam mohammad saffari

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...

Abstract: This study is carried out to describe the behaviour of vehicles flow on the road, in the presence of blocking effects. A non-linear three dimensional system of ordinary differential equations is used to describe vehicles flow on the road. The study classify total vehicles population on the road into three compartments as Free – Slow – Released vehicles. The formulated model is well-po...

Raviteja Buddala Siba Sankar Mahapatra

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

2016
Saad Louaqad Oulaid Kamach

This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...

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

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