نتایج جستجو برای: flowshop
تعداد نتایج: 634 فیلتر نتایج به سال:
The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...
We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags, denoted by Fm|θ, θ|Cmax. Time lag constraints generalize the classical precedence constraints between operations: minimal (respectively maximal) time lags indeed specify that the time elapsed between two operations must be lower(respectively upper-) bounded. We assume that such constraints ...
The manufacturing processes of a chip resistor are very similar to a flowshop scheduling problem only with minor details which can be modeled using some extra constraints; while permutation flowshop scheduling problems (PFSPs) have attracted much attention in the research works. Many approaches like genetic algorithms were dedicated to solve PFSPs effectively and efficiently. In this paper, a n...
Flowshop scheduling is an interdisciplinary challenge of addressing major optimality criteria of minimizing makespan and total-flow-time. The enumerations for finding the probabilities for improving the utilization of resources turn this problem towards NP-Hard. Particle Swam Optimization (PSO) has proven its ability to find of near optimal solution when problem size is large. Local search tech...
In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers’ service level. The use of a bicriteria objective is motivated by the fact that successful companies in today’s environment not only try to minimize their own cost but also try to fulfill ...
This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number ...
Please cite this article in press as: Ciavotta, M., e prehensive study. European Journal of Operatio The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as frommulti-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependen...
In this study, we consider a flexible manufacturing cell (FMC) processing identical parts on which the loading and unloading of machines are made by a robot. The machines used in FMCs are predominantly CNC machines and these machines are flexible enough for performing several operations provided that the required tools are stored in their tool magazines. Traditional research in this area consid...
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be vi...
In this research, we consider a two-machine permutation flowshop with ready times and limited waiting times of jobs in a semiconductor fab. In the flowshop, each job has its corresponding ready time (arrival time) at machine 1 (for the first operation) and limited waiting time between the completion time of the first operation on machine 1 and the starting time of the second operation on machin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید