نتایج جستجو برای: hybrid genetic algorithm scheduling permutation flow

تعداد نتایج: 1944541  

In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...

Today, the flow shop environment is the most customary production area in industry. But, the need to increase the capacity or the capacity balance in different production processes has caused that in some working stations there exists more than one machine. This type of flow shops are usually named hybrid flow shop, multi processes flow shop, flexible flow shop or flow shop with parallel machin...

G. Moslehi and M. Mahnam,

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...

A two-machine permutation flow shop scheduling with n independent jobs and different due dates is considered in this paper. Since this problem is shown to be NP-Hard, We use the simulated annealing to solve this problem. The objective is minimizing the weighted earliness and tardiness that cover JIT concept. We construct our algorithm in four scenarios with considering two Markov chains and two...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

1999
Sami Khuri Sowmya Rao Miryala

In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a sellsh gene algorithm, and tests th...

Journal: :Journal of physics 2022

Abstract Recently, The issue of energy consumption has become an that is often considered, and the manufacturing sector contributes to most significant proportion this problem. Energy-Efficient Permutation Flow Shop Scheduling Problem (EEPFSP) effective way solve This research offers a new algorithm Hybrid Multi-Verse Optimizer Algorithm (HMVO). Siz experiments are presented minimize total cons...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید