نتایج جستجو برای: flowshop
تعداد نتایج: 634 فیلتر نتایج به سال:
Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop schedulin...
In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...
The most general flowshop scheduling problem is also addressed in the literature as nonpermutation flowshop (NPFS). Current processors are able to cope with the (n!) m combinatorial complexity of non-permutation flowshop scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (...
Scheduling in a permutation flowshop refers to processing of jobs set available machines the same order. Among several possible performance characteristics flowshop, makespan remains one highest preferred metrics by researchers past six decades. The constructive heuristic proposed Nawaz-Enscore-Ham (NEH) is best for minimization. essentially depends on initial ordering according particular prio...
We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...
In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...
The assembly flowshop scheduling problem has been studied recently due to its applicability in real life scheduling problems. It arises when various fabrication operations are performed concurrently in one stage. It was firstly introduced by Lee et al. (1993) in a flowshop environment. Later, Potts et al. (1995) considered the two-stage assembly flowshop problem with m concurrent operations in ...
A flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow non-permutation flowshop scheduling (NPFS) and job sequences to be changed on different machines. A mixed-integer linear programming model for non-permutation flowshop scheduling and the buffer requirement along with manufacturing implication i...
Flowshop scheduling deals with processing a set of jobs through a set of machines, where all jobs have to pass among machines in the same order. With the exception of minimizing a makespan on two machines, almost all other flowshop problems in a general setup are known to be computationally intractable. In this paper we study a special case of flowshop defined by additional machine dominance co...
The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید