نتایج جستجو برای: flowshop
تعداد نتایج: 634 فیلتر نتایج به سال:
This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...
This chapter addresses three main problems of the production planning area: Single Machine Scheduling (SMS), Parallel Machine Scheduling (PMS) and Flowshop Scheduling (FS). Many situations in production environments found in industries around the world can be modelled as one or a set of them (Baker 1974). It is easy to find dozens of problem variants in the literature due to different productio...
New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders...
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small j...
In this research, we suggest some modified versions of existing heuristic algorithms for a two-machine flowshop scheduling problem, in which the each job has to be started on the second operation on the second machine within its assigned limited queue time after its first operation is completed on the first machine. The objective function of this scheduling problem is minimizing makespan. In ad...
In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job’s scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minim...
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide the recombination process. Within this framework, several recombination operators are specifically designed to preserve diversity within the population, while avoiding implicit mutations. The empirical evaluation of th...
We address the four-machine flowshop scheduling problem with objective of minimizing makespan uncertain processing times The was addressed in literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for problem. proposed is compared best by using extensive computational experiments. Computational experiments indicate th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید