Pub Date : 2020-08-14DOI: 10.26706/jpie.1.1.20200605
Amol B. Rajbhoj, A. Diwate
{"title":"Process Parameter Optimization of Sheet Metal Arc Welding of AISI 1020 Mild Steel","authors":"Amol B. Rajbhoj, A. Diwate","doi":"10.26706/jpie.1.1.20200605","DOIUrl":"https://doi.org/10.26706/jpie.1.1.20200605","url":null,"abstract":"","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89941358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-14DOI: 10.26706/jpie.1.1.20200609
Prashant R. Shinde, A. Diwate
{"title":"Parametric Optimization of Friction Welding of Aluminum Alloy 6351 and Steel 304","authors":"Prashant R. Shinde, A. Diwate","doi":"10.26706/jpie.1.1.20200609","DOIUrl":"https://doi.org/10.26706/jpie.1.1.20200609","url":null,"abstract":"","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"99 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73628664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-14DOI: 10.26706/jpie.1.1.20200701
Saurabh shahu, S. Shekhar
{"title":"Customer Oriented Quality and Quality Function Deployment: A Review","authors":"Saurabh shahu, S. Shekhar","doi":"10.26706/jpie.1.1.20200701","DOIUrl":"https://doi.org/10.26706/jpie.1.1.20200701","url":null,"abstract":"","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72771717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.203
P. Fattahi, M. Tanhatalab, Joerin Motavallian, M. Karimi
The present work addresses Inventory-Routing Rescheduling Problem (IRRP) in case of possible changes in the execution time of pre-planned scheduling of an Inventory-Routing Problem (IRP). Due to the complexity of the process of departing from one pre-planned scheduling IRP to a rescheduling IRP, a decision-support tool was devised in this study to help decision-makers. This complexity derives from the changes occurring in an agreed-upon schedule including the used capacity of the vehicle, total distance, and other factors that need a re-agreement negotiation, which directly relates to the agreed-upon costs, especially when a carrier contractor is responsible for the distribution of goods between customers. Although one may want to stick to the pre-planned scheduling, the changes in predicted data of the problem at the time of execution require a new optimized solution. The proposed approach applies mathematical modeling to the optimization of the rescheduled problem and conducts sensitivity analysis to study the effect of the adjustment of different variables (carried load, distance, etc.).
{"title":"An optimization model based decision support tools for inventory-routing rescheduling problem","authors":"P. Fattahi, M. Tanhatalab, Joerin Motavallian, M. Karimi","doi":"10.22068/IJIEPR.31.2.203","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.203","url":null,"abstract":"The present work addresses Inventory-Routing Rescheduling Problem (IRRP) in case of possible changes in the execution time of pre-planned scheduling of an Inventory-Routing Problem (IRP). Due to the complexity of the process of departing from one pre-planned scheduling IRP to a rescheduling IRP, a decision-support tool was devised in this study to help decision-makers. This complexity derives from the changes occurring in an agreed-upon schedule including the used capacity of the vehicle, total distance, and other factors that need a re-agreement negotiation, which directly relates to the agreed-upon costs, especially when a carrier contractor is responsible for the distribution of goods between customers. Although one may want to stick to the pre-planned scheduling, the changes in predicted data of the problem at the time of execution require a new optimized solution. The proposed approach applies mathematical modeling to the optimization of the rescheduled problem and conducts sensitivity analysis to study the effect of the adjustment of different variables (carried load, distance, etc.).","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"177 1","pages":"203-215"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77312283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.323
K. Krishnamraju
Now a days majority of commerce is taken place in electronic form. The e commerce transactions can be happened mainly in three forms. They are C2C(customer to customer), B2B(Business to business) and B2C(business to customer). Out of these B2C type of e-commerce is the most important one. Therefore there is a need of a secure protocol for performing B2C type of e-commerce transactions. The B2C type the main participating entities are customers, website and merchant. In this paper the communication between the website and merchant is represented by WM protocol. The design of WM protocol must consider several issues like problem definition, services, environment, vocabulary and message formats. The verification of WM protocol is also performed with respect to the protocol procedure rules based on linear temporal logic. The procedure rules related to the protocol is specified in process meta language. The verification is performed by using SPIN model checker and corresponding results are reported.
{"title":"Design and verification of WM protocol for Electronic Commerce Transactions","authors":"K. Krishnamraju","doi":"10.22068/IJIEPR.31.2.323","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.323","url":null,"abstract":"Now a days majority of commerce is taken place in electronic form. The e commerce transactions can be happened mainly in three forms. They are C2C(customer to customer), B2B(Business to business) and B2C(business to customer). Out of these B2C type of e-commerce is the most important one. Therefore there is a need of a secure protocol for performing B2C type of e-commerce transactions. The B2C type the main participating entities are customers, website and merchant. In this paper the communication between the website and merchant is represented by WM protocol. The design of WM protocol must consider several issues like problem definition, services, environment, vocabulary and message formats. The verification of WM protocol is also performed with respect to the protocol procedure rules based on linear temporal logic. The procedure rules related to the protocol is specified in process meta language. The verification is performed by using SPIN model checker and corresponding results are reported.","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"6 1","pages":"323-338"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74884784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.301
O. S. Nagesh, V. Naresh
{"title":"COMPARATIVE ANALYSIS OF MOD-ECDH ALGORITHM WITH VARIOUS ALGORITHMS","authors":"O. S. Nagesh, V. Naresh","doi":"10.22068/IJIEPR.31.2.301","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.301","url":null,"abstract":"","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"33 1","pages":"301-308"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85327628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.189
A. Roshani, D. Giglio
Multi-manned assembly line balancing problems (MALBPs) can be usually found in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost-oriented version of MALBPs, namely, CMALBP, is addressed. This class of problems may arise in final assembly lines of products in which the manufacturing process is very labor-intensive. Since CMALBP is NP-Hard, a heuristic approach based on a tabu search algorithm is developed to solve the problem. The proposed algorithm uses two neighborhood generation mechanisms, namely swap and mutation, that effectively collaborate with each other to build new feasible solutions; moreover, two separate tabu lists (associated with the two generation mechanisms) are used to check if moving to a new generated neighbor solution is forbidden or allowed. To examine the efficiency of the proposed algorithm, some experimental instances are collected from the literature and solved. The obtained results show the effectiveness of the proposed tabu search approach.
{"title":"A tabu search algorithm for the cost-oriented multi-manned assembly line balancing problem","authors":"A. Roshani, D. Giglio","doi":"10.22068/IJIEPR.31.2.189","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.189","url":null,"abstract":"Multi-manned assembly line balancing problems (MALBPs) can be usually found in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost-oriented version of MALBPs, namely, CMALBP, is addressed. This class of problems may arise in final assembly lines of products in which the manufacturing process is very labor-intensive. Since CMALBP is NP-Hard, a heuristic approach based on a tabu search algorithm is developed to solve the problem. The proposed algorithm uses two neighborhood generation mechanisms, namely swap and mutation, that effectively collaborate with each other to build new feasible solutions; moreover, two separate tabu lists (associated with the two generation mechanisms) are used to check if moving to a new generated neighbor solution is forbidden or allowed. To examine the efficiency of the proposed algorithm, some experimental instances are collected from the literature and solved. The obtained results show the effectiveness of the proposed tabu search approach.","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"25 1","pages":"189-202"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82912487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.259
R. Ramezanian, Maryam Afkham
A non-linear bi-level problem is suggested in this paper for wildfire self-evacuation planning, the upper problem of which includes binary variables and the lower problem includes continuous variables. In this model, the upper problem selects a number of links and adds them to the available evacuation network. It, moreover, predicts the traffic balance, and the time window of the links in the lower problem. A part of the objective function in the bi-level problem is non-linear which is linearized with a linear approximation method that does not require binary variables. Then the linear bi-level model is reformulated as a non- linear single level problem. This model is linearized and transferred into Mixed Integer Programing. The model is then used for the real case study of the Beechworth fire in 2009. The resulted outputs of the model are beneficial in planning design schemes for emergency evacuation to use the maximum potential of the available transportation network.
{"title":"A bi-level programing for wildfire self-evacuation network design","authors":"R. Ramezanian, Maryam Afkham","doi":"10.22068/IJIEPR.31.2.259","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.259","url":null,"abstract":"A non-linear bi-level problem is suggested in this paper for wildfire self-evacuation planning, the upper problem of which includes binary variables and the lower problem includes continuous variables. In this model, the upper problem selects a number of links and adds them to the available evacuation network. It, moreover, predicts the traffic balance, and the time window of the links in the lower problem. A part of the objective function in the bi-level problem is non-linear which is linearized with a linear approximation method that does not require binary variables. Then the linear bi-level model is reformulated as a non- linear single level problem. This model is linearized and transferred into Mixed Integer Programing. The model is then used for the real case study of the Beechworth fire in 2009. The resulted outputs of the model are beneficial in planning design schemes for emergency evacuation to use the maximum potential of the available transportation network.","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"24 1","pages":"259-267"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74676441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.295
V. Naresh, O. S. Nagesh, S. Sivaranjanireddi
Cognitive based (Chatbot) blood bank provides the communication platform among the stakeholders of blood bank. In the past the blood recipient will have to contact the blood bank and the blood donors individually, which is a time consuming process. To address this issue in this paper we propose a Secure Dynamic Interactive Blood Bank based on Cognitive Computing which can fulfill the blood request of the needy with less hardship. Hence the proposed work aims to overcome this problem by requesting the recipient to simply send a message to a chatbot. The motivated individuals who are willing to donate blood can register their name by interacting with the chatbot. If the requested blood group is available at the blood bank / registered donor then the recipient will get contact details of the blood bank / registered donors available at that instant. Donor data will be maintained in Cloud database. The proposed system is a cognitive chatbot, which acts as a communication platform among the stakeholders such as blood bank, blood donor and the needy. This system is built using cognitive technology of Google; it makes conversations using chatbots very similar to human conversations, thereby making the proposed system more efficient compared to the existing ones.
{"title":"Secure Dynamic Interactive Blood Bank based on Cognitive Computing","authors":"V. Naresh, O. S. Nagesh, S. Sivaranjanireddi","doi":"10.22068/IJIEPR.31.2.295","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.295","url":null,"abstract":"Cognitive based (Chatbot) blood bank provides the communication platform among the stakeholders of blood bank. In the past the blood recipient will have to contact the blood bank and the blood donors individually, which is a time consuming process. To address this issue in this paper we propose a Secure Dynamic Interactive Blood Bank based on Cognitive Computing which can fulfill the blood request of the needy with less hardship. Hence the proposed work aims to overcome this problem by requesting the recipient to simply send a message to a chatbot. The motivated individuals who are willing to donate blood can register their name by interacting with the chatbot. If the requested blood group is available at the blood bank / registered donor then the recipient will get contact details of the blood bank / registered donors available at that instant. Donor data will be maintained in Cloud database. The proposed system is a cognitive chatbot, which acts as a communication platform among the stakeholders such as blood bank, blood donor and the needy. This system is built using cognitive technology of Google; it makes conversations using chatbots very similar to human conversations, thereby making the proposed system more efficient compared to the existing ones.","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"27 1","pages":"295-300"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86742496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-10DOI: 10.22068/IJIEPR.31.2.231
M. Esmaili, S. Mousavi
To demonstrate the importance of customer satisfaction, one can mention a number of service providers that attempt to differentiate themselves in terms of their satisfied customers, witnessing high growth. In this paper, some factors such as driver consistent services and delivering fresh products that increase retailers' and customers’ satisfaction were considered in a Perishable Inventory Routing Problem (PIRP) under possibility and necessity classes of fuzzy uncertainty measures. In a typical Inventory Routing Problem (IRP), a distribution center delivers products to a set of customers through a limited time horizon and, simultaneously, makes a decision about inventory and routing to minimize the total cost. The proposed model was formulated as mixed-integer programming. Two types of consistent driver services were regarded for different kinds of customers including particular and typical customers. To investigate the validity of the model, the problem was solved at two values of possibility and necessity measures.
{"title":"An Integrated Perishable Inventory Routing Problem with Consistent Driver Services and Deliver Fresh Products using Possibility and Necessity Measures","authors":"M. Esmaili, S. Mousavi","doi":"10.22068/IJIEPR.31.2.231","DOIUrl":"https://doi.org/10.22068/IJIEPR.31.2.231","url":null,"abstract":"To demonstrate the importance of customer satisfaction, one can mention a number of service providers that attempt to differentiate themselves in terms of their satisfied customers, witnessing high growth. In this paper, some factors such as driver consistent services and delivering fresh products that increase retailers' and customers’ satisfaction were considered in a Perishable Inventory Routing Problem (PIRP) under possibility and necessity classes of fuzzy uncertainty measures. In a typical Inventory Routing Problem (IRP), a distribution center delivers products to a set of customers through a limited time horizon and, simultaneously, makes a decision about inventory and routing to minimize the total cost. The proposed model was formulated as mixed-integer programming. Two types of consistent driver services were regarded for different kinds of customers including particular and typical customers. To investigate the validity of the model, the problem was solved at two values of possibility and necessity measures.","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"1 1","pages":"231-242"},"PeriodicalIF":0.0,"publicationDate":"2020-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82152375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：