首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到13条相似文献,搜索用时 0 毫秒
1.
Effective solutions to the cell formation and the production scheduling problems are vital in the design of virtual cellular manufacturing systems (VCMSs). This paper presents a new mathematical model and a scheduling algorithm based on the techniques of genetic algorithms for solving such problems. The objectives are: (1) to minimize the total materials and components travelling distance incurred in manufacturing the products, and (2) to minimize the sum of the tardiness of all products. The proposed algorithm differs from the canonical genetic algorithms in that the populations of candidate solutions consist of individuals of different age groups, and that each individual's birth and survival rates are governed by predefined aging patterns. The condition governing the birth and survival rates is developed to ensure a stable search process. In addition, Markov Chain analysis is used to investigate the convergence properties of the genetic search process theoretically. The results obtained indicate that if the individual representing the best candidate solution obtained is maintained throughout the search process, the genetic search process converges to the global optimal solution exponentially.

The proposed methodology is applied to design the manufacturing system of a company in China producing component parts for internal combustion engines. The performance of the proposed age-based genetic algorithm is compared with that of the conventional genetic algorithm based on this industrial case. The results show that the methodology proposed in this paper provides a simple, effective and efficient method for solving the manufacturing cell formation and production scheduling problems for VCMSs.  相似文献   

2.
A joint decision of cell formation and parts scheduling is addressed for a cellular manufacturing system where each type of machine and part may have multiple numbers and parts must require processing and transferring in batches. The joint decision problem is not only to assign batches and associated machine groups to cells, but also to sequence the processing of batches on each machine in order to minimise the total tardiness penalty cost. A nonlinear mixed integer programming mathematical model is proposed to formulate the problem. The proposed model, within nonlinear terms and integer variables, is difficult to solve efficiently for real size problems. To solve the model for practical purposes, a scatter search approach with dispatching rules is proposed, which considers two different combination methods and two improvement methods to further expand the conceptual framework and implementation of the scatter search so as to better fit the addressed problem. This scatter search approach interactively uses a combined dispatching rule to solve a scheduling sub-problem corresponding to each integer solution visited in the search process. A computational study is performed on a set of test problems with various dimensions, and computational results demonstrate the effectiveness of the proposed approach.  相似文献   

3.
The primary objective of group technology (GT) is to enhance the productivity in batch manufacturing environment. The GT cell formation and fractional cell formation are done by using Kohonen self-organizing map (KSOM) networks. The effectiveness of the cell formation is measured with number of exceptional elements, bottleneck parts and grouping efficiency and the effectiveness of the fractional cell formation is measured by number of exceptional elements and the number of machines in the reminder cell. This method is applied to the known benchmarked problems found in the literature and it is found to be equal or best when compared to the other algorithms in terms of minimizing the number of the exceptional elements. The relative merits of using this method with respect to other known algorithms/heuristics in terms of computational speed and consistency are presented.  相似文献   

4.
A new concept is presented in this paper of quasi-dynamic cell formation for the design of a cellular manufacturing system, based on analysing the fact that static and dynamic cell formation could not reflect the real situation of a modern cellular manufacturing system. Further, workforce resources are integrated into quasi-dynamic cell formation and thus a quasi-dynamic dual-resource cell-formation problem is proposed. For solving this problem, this paper first establishes a non-linear mixed integer programming model, where inter-cell and intra-cell material cost, machine relocation cost, worker operation time, loss in batch quality and worker salary are to be minimised. Then, a multi-objective GA is developed to solve this model. Finally, a real life case study is conducted to validate the proposed model and algorithm. The actual operation results show that the case enterprise significantly decreases its material handling cost and workforce number and obviously increases its product quality after carrying out the obtained scheme.  相似文献   

5.
Instead of using expensive multiprocessor supercomputers, parallel computing can be implemented on a cluster of inexpensive personal computers. Commercial accesses to high performance parallel computing are also available on the pay-per-use basis. However, literature on the use of parallel computing in production research is limited. In this paper, we present a dynamic cell formation problem in manufacturing systems solved by a parallel genetic algorithm approach. This method improves our previous work on the use of sequential genetic algorithm (GA). Six parallel GAs for the dynamic cell formation problem were developed and tested. The parallel GAs are all based on the island model using migration of individuals but are different in their connection topologies. The performance of the parallel GA approach was evaluated against a sequential GA as well as the off-shelf optimization software. The results are very encouraging. The considered dynamic manufacturing cell formation problem incorporates several design factors. They include dynamic cell configuration, alternative routings, sequence of operations, multiple units of identical machines, machine capacity, workload balancing, production cost and other practical constraints.  相似文献   

6.
This paper focuses on a two-stage machining and welding scheduling problem based on an investigation at a structural metal manufacturing plant, aiming to minimise the total makespan. Several parts processed at Stage one according to classical job-shop scheduling are grouped into a single construction component at the second welding stage. Fabrication of the construction component cannot begin until all comprising parts have been completed at Stage one. This paper establishes a novel mathematic model to minimise the total makespan by mainly considering the dominance relationship between the construction component and the corresponding parts. In order to solve this two-stage problem, we propose an improved harmony search algorithm. A local search method is applied to the best vector at each iteration, so that a more optimal vector can be subsequently realised. The average value, minimum value, relative percentage deviation and standard deviation are discussed in the experimental section, and the proposed local best harmony search algorithm outperforms the genetic algorithm, immune algorithm and harmony search algorithm without local search. Moreover, six optimal solutions are given as Gantt charts, which vividly illustrate that the mathematical model established in this paper can facilitate the development of a better scheduling scheme.  相似文献   

7.
针对分布式实时任务中容易引起的任务分配不合理及系统负载不平衡的情况,根据分布式实时任务多机执行的特点及分布式实时系统在同一结点上有多任务执行,提出了两级分布式系统结构下实时任务的调度策略:任务分配和任务调度。实验表明,在任务分配阶段提出的算法可以更合理地平衡任务,在任务调度阶段采用的调度算法能够更好地完成任务的执行。  相似文献   

8.
In this paper, a new deadlock-free scheduling method based on genetic algorithm and Petri net models of flexible manufacturing systems is proposed. The optimisation criterion is to minimise the makespan. In the proposed genetic scheduling algorithm, a candidate schedule is represented by a chromosome that consists of two sections: route selection and operation sequence. With the support of a deadlock controller, a repairing algorithm is proposed to check the feasibility of each chromosome and fix infeasible chromosomes to feasible ones. A feasible chromosome can be easily decoded to a deadlock-free schedule, which is a sequence of transitions without deadlocks. Different kinds of crossover and mutation operations are performed on two sections of the chromosome, respectively, to improve the performance of the presented algorithm. Computational results show that the proposed algorithm can get better schedules. Furthermore, the proposed scheduling method provides a new approach to evaluate the performance of different deadlock controllers.  相似文献   

9.
Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.  相似文献   

10.
A branch and bound algorithm is described for optimal cyclic scheduling in a robotic cell with processing time windows. The objective is to minimise the cycle time by determining the exact processing time on each machine which is limited within a time window. The problem is formulated as a set of prohibited intervals of the cycle time, which is usually applied in the robotic cyclic scheduling problem with fixed processing times. Since both bounds of these prohibited intervals are linear expressions of the processing times, we divide these prohibited intervals into a series of the subsets and transform the problem into enumerating the non-prohibited intervals of cycle time in each subset. This enumeration procedure is completed by an efficient branch and bound algorithm, which could find an optimal solution by enumerating partial non-prohibited intervals. Computational results on the benchmark instances and randomly generated test instances indicate that the algorithm is effective.  相似文献   

11.
This paper applied a novel evolutionary algorithm, imperialist competitive algorithm (ICA), for a group scheduling problem in a hybrid flexible flow shop with sequence-dependent setup times by minimising maximum completion time. This algorithm simulates a social-economical procedure, imperialistic competition. Initial population is generated randomly and evolution is carried out during the algorithm. Firstly individuals, countries, are divided into two categories: imperialists and colonies. Imperialist competition will occur among these empires. This competition will increase some empires authority by ruining a weak empire and dividing its colonies among others. Electromagnetic-like mechanism concepts are employed here to model the influence of the imperialist on their colonies. The algorithm will continue until one imperialist exists and possesses all countries. In order to prevent carrying out extensive experiments to find optimum parameters of the algorithm, we apply the Taguchi approach. The computational results are compared with the outstanding benchmark on the flow shop scheduling problem, random key genetic algorithms (RKGA), and it shows superiority of the ICA.  相似文献   

12.
The fractal manufacturing system (FrMS) is based on the concept of autonomously cooperating agents referred to as fractals. A fractal is a set of self-similar agents whose goal can be achieved through cooperation, coordination, and negotiation among the agents for themselves. A fractal has fractal-specific characteristics (e.g. self-similarity, self-organization, self-optimization, goal-orientation, and dynamics), and it also has the characteristics of an agent (e.g. autonomy, mobility, intelligence, cooperation, and adaptability) at the same time. In the FrMS, a goal can be regarded as the status which the system aspires to be in. The goal-formation process (GFP) in the FrMS is a process of generating goals and modifying them by coordination between agents. In the GFP, conflicts may occur between goals, which can drive a system to become inefficient. In this paper, a conflict resolution mechanism via agent-based negotiation is proposed for facilitating the GFP. The scheme deals with non-fixed goals. The mobile agent-based negotiation process (MANPro), in which a mobile agent is used for information-exchanging and problem-solving, is used for negotiations in this scheme. The proposed mechanism is illustrated with a goal formation scenario in an exemplary FrMS.  相似文献   

13.
Cell formation is a traditional problem in cellular manufacturing systems that concerns the allocation of parts, operators and machines to the cells. This paper presents a new mathematical programming model for cell formation in which operators’ personality and decision-making styles, skill in working with machines, and also job security are incorporated simultaneously. The model involves the following five objectives: (1) minimising costs of adding new machines to and removing machines from the cells at the beginning of each period, (2) minimising total cost of material handling, (3) maximising job security, (4) minimising inconsistency of operators’ decision styles in cells and (5) minimising cost of suitable skill. On account of the NP-hard nature of the proposed model, NSGA-II as a powerful meta-heuristic approach is used for solving large-sized problems. Furthermore, response surface methodology (RSM) is used for tuning the parameters. Lastly, MOPSO and two scalarization methods are employed for validation of the results obtained. To the best of our knowledge, this is the first study that presents a multi-objective mathematical model for cell formation problem considering operators’ personality and skill, addition and removal of machines and job security.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号