نتایج جستجو برای: hybrid genetic algorithm scheduling permutation flow
تعداد نتایج: 1944541 فیلتر نتایج به سال:
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
this study aims to deal with a more realistic combined problem of project scheduling and material ordering. the goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. the problem is first mathematically modelled. then a hybrid simulated annealing and genetic algorithm is...
In order to solve the permutation flow shop scheduling problem, a multipopulation and self-adaptive genetic algorithm based on simulated annealing is proposed in this paper. For the precocity problem of traditional genetic algorithm, the multi-population coevolution strategy is adopted. We introduce a squared term to improve traditional self-adaptive genetic operators, which can increase the se...
In this work, we seek to design a model that contributes the study and resolution of multi-objective rescheduling problem in dynamic permutation flow shop contexts. type problem, where objectives can be valued heterogeneous units, difficulty achieving an optimal solution leads finding set non-dominated efficient solutions (also called Pareto front). On other hand, will also consider potential a...
Since the determination of efficient scheduling plans in sequencing problems with various criterions is considered an important problem, hence in this article a single machine sequencing problem with the minimization type delay and the total weighted lateness objectives are being studied. In this article, the applications of new optimization techniques in sequencing problems and scheduling are ...
A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flo...
According to the coexistence of two production style: Single Small Serial Production and Batch Production in the current Enterprise, this article analyzed the scheduling problems of this production model and studied the working flow of this production scheduling problem. Using Genetic Algorithm for the Scheduling Hybrid Production, a new system for solving the problems of Scheduling Hybrid Prod...
In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید