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...

<p class="Abstract"><span lang="EN-GB">The objective of this study is to develop a car assembly sequence that mutually agreed between manufacturers and Tier-1 module suppliers such overall modular supply chain efficiency improved. In the literature so far, only constraints have been considered in sequencing problem. However, an from manufacturer imposes on since their activities are...

Curriculum sequencing problem is crucial to e-learning system, which a NP-hard optimization and commonly solved by swarm intelligence. As form of intelligence, particle (PSO) widely used in various kinds problems. However, PSO found ineffective complex The main reason that diversity preservation, leading high risks be trapped the local optima. To solve this problem, novel hybrid algorithm propo...

Abstract Large Neighbourhood Search (LNS) is a powerful technique that applies the “divide and conquer” principle to boost performance of solvers on large scale Combinatorial Optimization Problems. In this paper we consider one main hindrances LNS popularity, namely requirement an expert define problem specific neighborhood. We present approach learns from structure search in order generate nei...

  This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .

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...

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...