A Novel Discrete Electromagnetism-Like for Fuzzy Open Shop Scheduling Problem with Parallel Machines to Minimize Makespan
A.
Jafari
Department of Industrial Engineering, Science and Culture University, Tehran, Iran
author
P.
Chiniforooshan
Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
author
F.
Mousavinejad
Department of Industrial Engineering, Science and Culture University, Tehran, Iran
author
Sh.
Shahparvari
Department of Industrial Engineering, Kish International Campus, University of Tehran, Kish Island, Iran
author
text
article
2012
eng
In this paper, we consider the fuzzy open shop scheduling problem with parallel machines in each working stage where processing times are vague and are represented by fuzzy numbers. An open shop scheduling problem with parallel machines in each working stage under this condition is close to the real production scheduling conditions. A mixed-integer fuzzy programming (MIFP) model is presented to formulate this problem with the objective of minimizing makespan. To solve small-sized instances, an interactive fuzzy satisfying solution procedure is applied. Since this problem is known as a class of NP-hard, a novel discrete electromagnetism-like (DEM) is proposed to solve medium to large size examples. The DEM algorithm employs a completely difference approach. It makes use the crossover operators to calculate force and move particle is used. We employ Taguchi method to evaluate the effects of different operators and parameters on the performance of DEM algorithm. Finally to assess the performance of the algorithm, the results are compared with an existing EM algorithm from the literature and benchmark problems. The result exhibited the ability of the proposed DEM algorithm to converge to the efficient solutions.
International Journal of Research in Industrial Engineering
Ayandegan Institute of Higher Education
2783-1337
1
v.
3
no.
2012
1
25
https://www.riejournal.com/article_47874_22f6e95104f90457ac44cabb5ea1d358.pdf
Optimization of Emergency Management System in a Construction Organization in India
S.V.S.
Raja Prasad
Department of Mechanical Engineering, KLUniversity, Vaddeswaram, Guntur District, Andhra Pradesh, India.
author
Y.V.S.S.S.V.
Prasad Rao
Department of Mechanical Engineering, KLUniversity, Vaddeswaram, Guntur District, Andhra Pradesh, India.
author
text
article
2012
eng
It is not possible to eliminate the workplace emergencies but can be mitigated by effective planning. In all the construction organizations the possibility of facing emergencies is common. The objective of emergency management is to minimize losses that result out of emergencies. The employees in construction organizations are susceptible various workplace emergencies like fire, explosion, collapse of a structure/excavated side walls, scaffolding and tower cranes etc.. Site-specific emergency plan is to be prepared to prevent emergencies in construction organizations. The emergency preparedness plan must comprise of identifying probable emergencies and how to respond to emergency situation so as to minimize the total response time of employees to report to emergency assembly point. In most of the construction organizations in India are following conventional methods instead of implementing scientific techniques in emergency planning particularly while earmarking emergency assembling points and also allocation employees to assembly points resulting into wastage of time, damage to employees and property. A study was conducted in a construction organization involved in construction of 2*660MW thermal power plant in India by using combination of optimization techniques like shortest route algorithm for identifying optimal paths and depending on the capacities of assembly points ,the employees are allocated to different assembly points by using transportation model .In a case of a major emergency, the minimal spanning tree technique is used to identify the shortest route for a specific assembly point.
International Journal of Research in Industrial Engineering
Ayandegan Institute of Higher Education
2783-1337
1
v.
3
no.
2012
26
38
https://www.riejournal.com/article_47899_c5bfb3d2f8b09273822650db2d0d7a81.pdf
A New Method to Organizational Ranking: Integrating BSC and DEA
H.
Golpîra
Department of Industrial Engineering, Islamic Azad University, Sanandaj Branch, Sanandaj, Kurdistan, Iran
author
A.
Mohajeri
Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
author
text
article
2012
eng
Nowadays, managers tend to compare their organizations with the others as well they want to have benchmarks. Benchmarking should be based on correct updated organizational critical factors. Balanced scorecard (BSC) is the tool to translate the organizational strategic goals into the operational critical factors by its strategy map. It individually may not use as the tool for organizational comparison. Data envelopment analysis (DEA) is essentially used to evaluate decision making units (DMUs) from the best possible relative efficiency. But it's incapable of defining its input and output indexes efficiently. So, in this paper the most important strategic factors obtained from BSC are employed as the input data for DEA. This may lead us to a comprehensive benchmarking method to attain the reliable appropriate results for each organization in each period. Finally, the proposed method is practically tested and the results are illustrated in the following paragraphs.
International Journal of Research in Industrial Engineering
Ayandegan Institute of Higher Education
2783-1337
1
v.
3
no.
2012
39
47
https://www.riejournal.com/article_47900_ad8ae383edad21987db5abb08b5ba120.pdf
Simulation in Citizen Relationship Management
E.
Teymournejad
Department of Industrial Engineering, K.N.Toosi University of Technology, Tehran, Iran
author
M.J.
Tarokh
Department of Industrial Engineering, K.N.Toosi University of Technology, Tehran, Iran
author
text
article
2012
eng
Telecommunications play an important role in providing services for citizen and through this study is been trying to use modeling and simulation system for Communications Center (solving failure process) also solving problem, speed of solving the failure, followed by optimization system and offers a model for managers . Based on this role the manager can use the model that presented above for identifying different strategies then applying best practice for satisfying citizens (citizen relationship management (CIRM). For example, before the occurrence of a repeated failure can identify risky areas and detect them. If we assumed, service provider are as customers that used government services, the managers can evaluate productivity of service providers and choose the right reward system or the decision for using more service providers. No technical managers can use this model Because of its simple structure. The above system has been simulated with the Arena software and because the system simulation credit on random numbers we have used the data registered in the system for probability distribution function.
International Journal of Research in Industrial Engineering
Ayandegan Institute of Higher Education
2783-1337
1
v.
3
no.
2012
48
59
https://www.riejournal.com/article_47901_3ea86a00cacaa63fa609746f089de0ed.pdf
Solving FMS Assignment Problem with Grouping Genetic Algorithm
M.H.M.A.
Jahromi
Departement of Industrial Engineering, Khomein Branch, Islamic Azad University, Khomein, Iran.
author
R.
Jafari
Departement of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.
author
A.
Shamsi
Departement of Industrial Engineering, Khomein Branch, Islamic Azad University, Khomein, Iran.
author
text
article
2012
eng
Operations assignment to feasible and suitable machine-tool combination affects the total production costs and selecting the best combinations is important for these systems, this is one of the significant problems in flexible manufacturing systems (FMSs). In this paper, minimizing the machining cost, setup cost and material handling cost for the given multi-objective problem is considered. Also, this problem is solved with a grouping genetic algorithm and the associated results are presented.
International Journal of Research in Industrial Engineering
Ayandegan Institute of Higher Education
2783-1337
1
v.
3
no.
2012
60
68
https://www.riejournal.com/article_47902_76259690ac6c89461cbdc9b6b2200e52.pdf