International Journal of Industrial Engineering and Productional Research
Volume:31 Issue: 2, Jun 2020

In the present work, a model based on dimensional analysis (DA) coupled with the Taguchi method to analyze the impact of silicon carbide (SiC) has been presented. The wire cut electrical discharge machining (WEDM) performance of aluminium silicon carbide (AlSiC) metal matrix composite (MMC) has been critically examined. To formulate the DA based models, total 18 experiments were conducted using Taguchi’s L18 mixed plan of experimentation. The input data used in the DA models are a pulse on time, pulse off time, wire feed rate, % SiC, wire tension, flushing pressure etc. According to these process parameters, DA models for the surface roughness and the material removal rate was predicted. The formulated DA models have shown a strong correlation with the experimental data. The analysis of variance (ANOVA) has been used to find out the impact of individual parameters on response parameters.

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.

The present work addresses inventory-routing rescheduling problem (IRRP) that is needed when some minor changes happen in the time of execution 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, here a decision-support tool is devised to help the decision-maker. This complexity comes from the issue that changes in an agreed schedule including the used capacity of the vehicle, total distance and other factors that need a re-agreements negotiation which directly relates to the agreed costs especially when a carrier contractor is responsible for the distribution of goods between customers. From one side he wants to stick to the pre-planned scheduling and from the other side, changes in predicted data of problem at the time of execution need a new optimized solution. The proposed approached applies mathematical modeling for optimizing the rescheduled problem and offers a sensitivity analysis to study the influence of the different adjustment of variables (carried load, distance, …).

Sustainable supply chain networks have attracted considerable attention in recent years as a means of dealing with a broad range of environmental and social issues. This paper reports a multi-objective mixed-integer linear programming (MILP) model for use in the design of a sustainable closed loop supply chain network under uncertain conditions. The proposed model aims to minimize total cost, optimize environmental impacts of establishment of facilities, processing and transportation between each level as well as social impacts including customer satisfaction. Due to changes in business environment the uncertainty existed in the research problem, in this paper the chance constrained fuzzy programming approach applied to cope with uncertainties in parameter of the proposed model. Then the proposed multi-objective model solves as single-objective model using LP-metric method.

To demonstrate the importance of customer satisfaction can mention numbers of the service providers that attempt to differentiate themselves by satisfied their customers, witnessed high growth. In this paper, some factors that increase retailers and customers’ satisfaction, such as driver consistent services and delivering fresh products, are considered in a perishable inventory routing problem (PIRP) under possibility and necessity class 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 is formulated as mixed-integer programming. Two types of consistent driver services are regarded for different kinds of customers, including particular and typical customers. To investigate the validity of the model, the problem is solved for two values of possibility and necessity measures.

The number of natural disasters and people affected by them has been increasing in recent years. The field of optimization is a significant element of a relief operation and has been extensively studied so far, especially during the last two decades. The design of a relief logistic network as a strategic decision and the relief distribution as an operational decision are the most important activities for disaster operation management before and after a disaster occurs. In the proposed mathematical model, pre-disaster decisions are determined according to the post-disaster decisions in a multi-stage stochastic problem. Then a well-known approach called branch and fixed coordination are applied to optimize the proposed model. The computational results confirm that the proposed approach has proper performance for disaster management in a multi-stage stochastic problem.

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.

It is indispensable that any manufacturing system is consistent with potential changes such as fluctuations in demand. The uncertainty also makes it more essential. Routing Flexibility (RF) is one of the necessities to any modern manufacturing system such as Flexible Manufacturing System (FMS). This paper suggests three mixed integer nonlinear programming models for the Unequal–Area Stochastic Dynamic Facility Layout Problems (UA–SDFLPs) by considering the Routing Flexibility. The models are proposed when the independent demands follow the random variable with the Poisson, Exponential, and Normal distributions. To validation of the proposed models, many small-sized test problems has solved that derived from a real case in literature. The large-sized test problems are solved by the Genetic Algorithm (GA) at a reasonable computational time. The obtained results indicate that the discussed models for the UA–SDFLPs are valid and the managers can take these models to the manufacturing floor to adapt to the potential changes in today's competitive market.

This paper aims to study multi- objective assignment (NMOAS) problem with imprecise costs instead of its prices information. The NMOAS problem is considered by incorporating single valued trapezoidal neutrosophic numbers in the elements of cost matrices. After converting the NMOAS problem into the corresponding crisp multiobjective assignment (MOAS) problem based on the score function, an approach to find the most preferred neutrosophic solution is discussed. The approach is used through a weighting Tchebycheff problem which is applied by defining relative weights and ideal targets.  The advantage of this approach is more flexible than the standard multi- objective assignment problem, where it allows the decision maker (DM) to choose the targets he is willing. Finally, a numerical example is given to illustrate the utility, effectiveness and applicability of the approach.

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.

Cryptography is a well-known and well-researched topic for ages. Cryptography is the first line of defense for any networked system. By using Symmetric as well as Asymmetric Cryptography a lot of algorithms are developed. From the security point of view, Asymmetric Cryptography is more popular as security has been enhanced. RSA, DSA, ECS, DES, ECC and other algorithms have been developed for realizing Asymmetric Cryptosystem. These algorithms are primarily used for secure and reliable communication. These algorithms play a vital role in secure communication. Elliptic Curve Cryptography (ECC) provides similar security having less key size among them. In the present paper, an improved MOD-ECDH has been proposed and the proposed algorithm has been compared with other various popular algorithms like ECDH, RSA, ECS has been demonstrated. A detail both empirical and simulation study of the algorithm of ECDH and MOD-ECDH has been depicted. From result analysis, it is evident that the proposed algorithm outperforms the other algorithms in point of processing time and key size.

Blockchain is a decentralized distributed network which allows peer-to-peer(P2P) communication among the users. As the name indicates, it deals with the group of records called blocks. We are in an era where both it is important to maintain the integrity of data as well as to fasten the process of the transaction. Blockchain helps in doing these by maintaining the timestamp on blocks and time required for a transaction can be reduced by eliminating the need of the third party during the process of the transaction. Bitcoin and Smart contract are the two major applications based on blockchain technology. Bitcoin is the first application which was developed on blockchain Technology and is a popularly known crypto-currency. Satoshi Nakamoto is the person who is behind the development of bitcoin [1]. Smart contract was defined by Szabo as " set of promises, specified in digital form, including protocols within which the parties perform on these promises [2]. This paper aims in bringing a detailed overview of blockchain and its applications followed by a case study on bitcoin.

Nowadays, data are the food for the digital world. The main rich sources for data generated by social networks such as Twitter, Face book, Instagram, and LinkedIn. The data generated from micro-blogging services are plays a vital role in business intelligence like product reviews, movie reviews, election results prediction by social media data analysis. Sentiment analysis (SA) is the key method of predicting netizens emotions behind the text expressed in social media. The main motto of this survey to give complete idea about tools and the techniques used in Sentiment Analysis and the relevant fields with brief details.

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.