در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Modern Processes in Manufacturing and Production
- نوع مقاله: Journal Article
- کلمات کلیدی: Genetic Algorithm,Scheduling,Simulated Annealing,Mathematical formulation,Virtual cellular manufacturing systems
- چکیده:
- چکیده انگلیسی: In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machines are spread on the shop floor physically. In this paper, there are multiple jobs with different manufacturing processing routes. First, we develop the mathematical model for the problem, and then we present the suggested algorithms. The scheduling objective is weighed tardiness and total travelling distance minimization. The problem is divided into two branches: small scale and large scale. For small scale, the results of GA and SA are compared to GAMS. For large scale problems, due to the time limitation of 3600 seconds, the results of GA and SA are compared to each other. Computational results show that both SA ad GA algorithms perform properly but SA is likely to turn out well in finding better solutions in shorter times especially in large scale problems.
- انتشار مقاله: 18-05-1394
- نویسندگان: Saeed Taouji Hassanpour,Reza Bashirzadeh,Abolfazl Adressi,Behnam Bahmankhah
- مشاهده
- جایگاه : پژوهشی
- مجله: Journal of Modern Processes in Manufacturing and Production
- نوع مقاله: Journal Article
- کلمات کلیدی: Metaheuristic algorithms,Sequence Dependent Setup Times,Group Scheduling,No-wait Flow Shop
- چکیده:
- چکیده انگلیسی: Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly substituted with new ones for improving the efficiency and effectiveness of the entire production system. In this paper, two Meta-heuristic algorithms, Genetic and simulated annealing, have been used in order to solve the group scheduling problem of jobs in a single stage No-wait flow shop environment in which setup times are sequence dependent,. The purpose of solving the proposed problem is to minimize the maximum time needed to complete the jobs (Makespan). The results show that Genetic algorithm is efficient in problems with small and large dimensions, with respect to time parameter of problem solving.
- انتشار مقاله: 31-02-1394
- نویسندگان: Abolfazl Adressi,Reza Bashirzadeh,Vahid Azizi,Saeed Tasouji Hassanpour
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Full coverage,Probabilistic protection,r-interdiction median problem,Stackelberg game,Tri-level programming
- چکیده:
- چکیده انگلیسی: In this paper, a tri-level defense facility location model for full coverage in r-interdiction median problem is delivered. The purpose of this model is to design a proper service system in a way that after a worst case scenario of disturbance, they can utilize their full capacity of providing services. Hence, we have considered the defense facilities to provide extra protection for service facilities, and the goal is to optimally locate these facilities. The tri-level model is proposed based on leader-follower games as defender-attacker-defender framework. After the disturbance caused by the attacker, with the purpose of ensuring the operation of service facilities, the defender tries to establish a number of defense facilities in potential locations. Locating these facilities is carried with respect to the establishment of fixed cost of facilities and system’s current cost. It should be noted that each service facility must be at least within the coverage range of at least one defense facility (first level).So, system’s current costs can be defined based on the worst-case scenario of disturbance caused by the attacker. The problem is modeled as a static Stackelberg game between the attacker (level 2) and defender (level 3). In order to solve the model, two approaches have been used. In the first approach, explicit enumeration method is used for the first and second levels and an exact approach is used for the third level. In the second approach, hybrid methods consisting of genetic algorithm, explicit exact enumeration and exact approach have been used to solve the problem in a reasonable time. Comparing the proposed meta-heuristic to the exact approach in some samples, the numerical results show a quite satisfactory of this algorithm.
- انتشار مقاله: 30-03-1395
- نویسندگان: Seyed Parsa Parvassi,Reza Bashirzadeh,Farid Khoshalhan
- مشاهده