نتایج جستجو برای: flow shop
تعداد نتایج: 491569 فیلتر نتایج به سال:
The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial background. Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to inve...
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed f...
In this paper, we present an approach to deal with fuzzy constraints in a flow shop problem. The flexible constraints on job release date and due date, as well as job processing time are described by fuzzy sets. We propose a method to calculate the satisfaction degree of the schedule with respect to fuzzy release dates and fuzzy due dates of jobs. The objective is to obtain a schedule which has...
The two-stage hybrid flow shop problem under setup times is addressed in this paper. This NP-Hard. on the other hand, studied modeling different real-life applications especially manufacturing and high performance-computing. Tackling kind of requires development adapted algorithms. In context, a metaheuristic using genetic algorithm three heuristics are proposed These approximate solutions opti...
Makespan minimisation in permutation flow shop scheduling is an OR topic that has been intensively addressed in the last 40 years. Since the problem is known to be NPcomplete for more than two machines, most of the research effort has been devoted to the development of heuristic procedures in order to provide good approximate solutions to the problem. However, little attention has been devoted ...
We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic value of the machine. We show that the...
The max / / C idle no F − problem is solved by a branch and bound algorithm, or a mixed integer programming solver. This problem is known to be NP-hard. The noidle flow-shop configuration, where machines work continuously without idle intervals is an interesting manufacturing environment in many industries. The idle characteristic is a very strong constraint and it affects seriously the value o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید