Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
Maximum Multivariate Exponentially Weighted Moving Average and Maximum Multivariate Cumulative Sum Control Charts for Simultaneous Monitoring of Mean and Variability of Multivariate Multiple Linear Regression Profiles
2605
2622
EN
Reza
Ghashghaei
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran
r.qashqaei@shahed.ac.ir
Amirhossein
Amiri
0000-0002-2385-8910
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran
amirhossein.amiri@gmail.com
10.24200/sci.2017.4385
In some application, quality of product or performance of a process described by some functional relationships between some variables known as multivariate linear profile in the literature. In this paper, we propose Max-MEWMA and Max-MCUSUM control charts for simultaneous monitoring of mean vector and covariance matrix in multivariate multiple linear regression profiles in Phase II. The proposed control charts also have ability to diagnose either the location or variation of the process is responsible for out-of-control signal. The performance of the proposed control charts is compared with existing method through Monte-Carlo simulations. Finally, the applicability of the proposed control charts is illustrated using a real case of calibration application in the automotive industry.
Multivariate multiple linear regression profiles,simultaneous monitoring,Phase II,Diagnosis aids
https://scientiairanica.sharif.edu/article_4385.html
https://scientiairanica.sharif.edu/article_4385_3d3ba7aaaa9e7a9bf438a8f73980bee1.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
Some improved interactive aggregation operators under interval-valued intuitionistic fuzzy environment and its application to decision making process
2581
2604
EN
Harish
Garg
0000-0001-9099-8422
School of Mathematics, Thapar University Patiala 147004, Punjab, India
harishg58iitr@gmail.com
Nikunj
Agarwal
Department of Mathematics, Jaypee Institute of Information and Technology Noida - 201307, U.P., India
Alka
Tripathi
Department of Mathematics, Jaypee Institute of Information and Technology Noida - 201307, U.P., India
10.24200/sci.2017.4386
The objective of this manuscript is to present an improved aggregator operator by taking into account<br />the effect of an unknown degree (hesitancy degree) in an interval-valued intuitionistic fuzzy<br />sets (IVIFSs) environment. For this, firstly the shortcoming of the existing operators is addressed<br />and then some improved operational laws on IVIFSs have been introduced. Based on these laws, an<br />aggregation operator, namely an interval-valued intuitionistic fuzzy Hamacher interactive weighted<br />averaging (IVIFHIWA), ordered weighted averaging (IVIFHIOWA) and hybrid weighted averaging<br />(IVIFHIHWA), have been proposed. Various properties related to these operators are also investigated.<br />Furthermore, based on these operators, an approach to deal with multi-criteria decision<br />making (MCDM) problem is developed. Finally, a practical example is provided to illustrate the<br />decision making process.
MCDM,interval-valued intuitionistic fuzzy set,Aggregation operator,Hamacher operations
https://scientiairanica.sharif.edu/article_4386.html
https://scientiairanica.sharif.edu/article_4386_d2fcb44c7de7a63b8a51a5ef252051e5.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
Integrated Dynamic Cell Formation-Production Planning: A New Mathematical Model
2550
2566
EN
Masoud
Rabbani
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
mrabani@ut.ac.ir
Sina
Keyhanian
Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, Iran
Neda
Manavizadeh
Department of Industrial Engineering, Khatam University, Tehran, Iran
n.manavi@khatam.ac.ir
Hamed
Farrokhi-Asl
School of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran
hamed.farrokhi@ut.ac.ir
10.24200/sci.2017.4387
In this paper a dynamic cell formation problem is presented considering some new and special characteristics. The concept of machine requirement by lucky parts, the parts which are allowed to be produced in a specific period, is combined with the depreciable property of machines. Therefore, purchasing and selling of machines according to their book-value and generating income have been taken into account. This leads to a new vantage characteristic in cell formation where in each period we are only dealing with the types and number of machines required. The new mathematical model is presented and solved by exact and ant colony optimization methods for three problem sizes.
Dynamic cell formation,Dynamic production planning,Integrated mathematical model,Lot splitting,ant colony optimization
https://scientiairanica.sharif.edu/article_4387.html
https://scientiairanica.sharif.edu/article_4387_141fbba0b827d13b2996293dd3a3ab6c.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
Design of an innovative construction model for supply chain management by measuring agility and cost of quality: An empirical study
2515
2526
EN
Y.
Rahimi
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
R.
Tavakkoli-Moghaddam
0000-0002-6757-926X
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
tavakoli@ut.ac.ir
S.
Shojaie
School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
I.
Cheraghi
Department of Industrial Engineering, Albourz Campus, University of Tehran, Tehran, Iran
10.24200/sci.2017.4388
This paper aims to present a model for an agile supply chain network in construction enterprises with performance evaluation of suppliers and contractors. Management and selection of suppliers and contractors play an important role in the process of constructions since contractors are as corner stones of construction projects. Additionally, contractors are the main factor in converting resources to final products. Traditionally, contractor selection in construction projects is on the basis of the lowest proposed price. However, there are various qualitative and quantitative criteria with different priorities associated in this regards in order to make the best decision. In this paper, a hybrid method of DEA/AHP/FDEMATEL is used. First, important and effective evaluation criteria are selected through an FDEMATEL method. Then, the DEA/AHP method is implemented in order to evaluate and prioritize the selected indicators as well as to incorporate them in a supply chain. Furthermore, agility is involved in the considered supply chain network. Furthermore, in this paper for the first time in Iran, a supply chain model is studied and designed for civil companies.
Construction supply chain management,Agility,Suppliers performance evaluation,Cost of quality
https://scientiairanica.sharif.edu/article_4388.html
https://scientiairanica.sharif.edu/article_4388_70d440d5aaa38ce461930823400198f8.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
A new mathematical model for integrated production planning and scheduling problem in capacitated flexible flow shop with sequence-dependent setups
2501
2514
EN
Reza
Ramezanian
Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
ramezanian@kntu.ac.ir
Sahar
Fallah Sanami
Department of Economic and Management, Semnan University, Semnan, Iran.
fallah.sahar@gmail.com
Vahid
Mahmoodian
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
vahid_mahmoodian@ind.iust.ac.ir
10.24200/sci.2017.4389
The main contribution and novelty of this paper is proposing a more efficient mathematical model for integrated lot-sizing and scheduling in a multi-product multi-period capacitated flexible flow shop with sequence-dependent setups. A new approach for modeling the problem has been proposed and its complexity compared with former models. In comparison to the former models, because of fewer continuous and binary variables and constraints of proposed model makes it easy to be solved. Comparison between new model and former models proves the superiority of proposed model. Due to the complexity of the problem, three mixed-integer programming based heuristics all based on iterative resolutions of reduced-size MIPs and rolling horizon have been implemented to solve model. To evaluate the performance of the proposed model and solution method, problems of different scales have been studied. The used algorithms search the solution space for both lot-sizing and scheduling and find a combination of production planning and scheduling that is feasible and close to optimum. Computational results show that HA2 is superior for this problem and can find good quality solution for the problem in a reasonable computational time. Also, sensitivity analysis is used to clarify the problem and ensure suitability of the proposed model.
lot-sizing and scheduling,Flexible flow shop,mathematical model,Sequence-dependent setup,MIP-based method,Fix-and-relax procedure
https://scientiairanica.sharif.edu/article_4389.html
https://scientiairanica.sharif.edu/article_4389_00c032f8def5664959e791731e6da7f5.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
The combination of TOPSIS method and Dijkstra’s algorithm in multi-attribute routing
2540
2549
EN
E.
Roghanian
Faculty of Industrial Engineering department, Khaje Nasir University of Technology; Address: No. 7, Pardis Avenue, Vanak Square, Tehran, Iran
Z.
Shakeri Kebria
Khaje Nasir University of Technology; Address: No. 7, Pardis Avenue, Vanak Square, Tehran, Iran
10.24200/sci.2017.4390
This paper introduces a new method called multi-attribute Dijkstra that is an extension of Dijkstra to determine the shortest path between two points of a graph while arcs between points, in addition to the distance, have other attributes such as time(distance), cost, emissions, risk and etc. Technique for order preferences by similarity to ideal (TOPSIS) method is used for ranking and selection of the routes which is a method for solving multi-attribute decision making problems (MADM). In this regard, we try to choose appropriate weights for the attributes to consider the right decision to create a balance between the effective elements in route selection. In this paper, the algorithm of Dijkstra and TOPSIS will be reviewed and the proposed method obtained by the combination of these two will also be described. Finally, three examples with different conditions are presented to represent the performance of the model. Then these examples are compared with single-attribute Dijkstra to realize effectiveness of the proposed method. Obviously in solving large-scale examples the approach based on coding in appropriate software.
multi-attribute routing,multi-attribute Dijkstra,Dijkstra's algorithm,shortest path,TOPSIS,multi-criteria decision making problems
https://scientiairanica.sharif.edu/article_4390.html
https://scientiairanica.sharif.edu/article_4390_98500d97b610181207816f13c4f171f7.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
A capacitated bike sharing location-allocation problem under demand uncertainty using sample average approximation: A greedy Genetic-Particle Swarm Optimization algorithm
2567
2580
EN
Ehsan Ali
Askari
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran
Mahdi
Bashiri
0000-0002-5448-1773
Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran
bashiri@shahed.ac.ir
Reza
Tavakkoli-Moghaddam
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
tavakoli@gmail.com
10.24200/sci.2017.4391
This paper considers a stochastic location-allocation problem for a capacitated bike sharing system (S-L&A-CBSS), in which a bike demand is uncertain. To tackle this uncertainty, a sample average approximation (SAA) method is used. Because this problem is an NP-hard problem, a hybrid greedy evolutionary algorithm based on genetic algorithm (GA) and particle swarm optimization (PSO), namely greedy GA-PSO is embedded in the SAA method in order to solve the given large-sized problems. The performance of the proposed hybrid algorithm is tested by a number of numerical examples and used for empirical test based on Tehran business zone. Furthermore, the associated results show its efficiency in comparison to an exact solution method in solving small-sized problems. Finally, the conclusion is provided.
Bike sharing systems,stochastic programming,Hybrid evolutionary algorithm,Sample average approximation
https://scientiairanica.sharif.edu/article_4391.html
https://scientiairanica.sharif.edu/article_4391_39949bacbfe1032497143d245a6798a9.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
A fuzzy dynamic multi-objective, multi-item model by considering customer satisfaction in supply chain
2623
2639
EN
Shabnam
Fazli Besheli
Department of Industrial Engineering, Mazandaran Institute of Technology, Babol, Mazandaran, Iran
shabnam.fazli@mit.ac.ir
Ramazan
Nemati Keshteli
bFaculty of Engineering- East Guilan, University of Guilan, Rasht, Iran
Saeed
Emami
Department of Industrial Engineering, Babol Noshirvani University of Technology, Babol, Mazandaran, Iran
Seyedeh Mansooreh
Rasouli
Department of Industrial Engineering, Mazandaran Institute of Technology, Babol, Mazandaran, Iran
mansooreh.rasouli@mit.ac.ir
10.24200/sci.2017.4392
Customer satisfaction is an important issue in competitive strategic management of companies. Supply chain logistical and cross-functional drivers have an important role to manage customer satisfaction. Customer satisfaction depends on quality, cost and delivery. In this paper a fuzzy mixed integer nonlinear programming model is proposed for a multi-item multi-period problem in multi-level supply chain. Minimizing costs, manufacturing and transportation time, transportation risks, maximizing quality by minimizing the number of defective products and maximizing customers’ service levels are considered to be objective functions of the model. Furthermore, it is assumed that the demand rates are fuzzy values. An exact -constraint approach is used to solve the problem. The problem is computationally intractable. Therefore, the Non-dominant Sorting Genetic Algorithm (NSGA-II) is developed to solve it. The Taguchi method is utilized to tune the NSGA-II parameters. Finally, some numerical examples are generated and solved to evaluate the performance of the proposed model and solving methods.
supply chain optimization,Transportation Risk,Customer Satisfaction,Quality
https://scientiairanica.sharif.edu/article_4392.html
https://scientiairanica.sharif.edu/article_4392_111be78bd234eda9053db453285f1503.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
A simple solution procedure to solve the multi-delivery policy into economic production lot size problem with partial rework
2640
2644
EN
Kun-Jen
Chung
College of Business, Chung Yuan Christian University, Chung Li, Taiwan, R. O. C.
Pin-Shou
Ting
Department of International Business Management, Shih Chien University, Taipei, Taiwan, R. O. C
Leopoldo Eduardo
Cárdenas-Barrón
School of Engineering and Sciences, Tecnológico de Monterrey.
Ave. Eugenio Garza Sada 2501 Sur, C.P. 64849, Monterrey, Nuevo León, México
10.24200/sci.2017.4484
Recently, an alternative multi-delivery policy into imperfect economic production quantity (EPQ) inventory model with partial rework has been proposed, which considers the number of shipments a fixed and given value. This paper, treating the long-run average costs per unit time as a function of the replenishment lot size and the number of shipments , adopts the differential calculus approach to get the optimal solution of and jointly. In numerical examples, it is illustrated that the solution procedure is simple and accurate.<br />
Replenishment lot size,multiple shipments,manufacturing,rework,scrap,Inventory
https://scientiairanica.sharif.edu/article_4484.html
https://scientiairanica.sharif.edu/article_4484_3bfe392c8e39740d589db23cf1b2f36d.pdf
Sharif University of Technology
Scientia Iranica
1026-3098
2345-3605
24
5
2017
10
01
Multidimensional Knapsack Problem Based on Uncertain Measure
2527
2539
EN
Li
Cheng
College of Mathematics and Physics, Huanggang Normal University, Hubei 438000, China
Congjun
Rao
School of Science, Wuhan University of Technology, Wuhan 430070, China
cjrao@163.com
Lin
Chen
College of Mathematics and Sciences, Shanghai Normal University, Shanghai 200234, China
10.24200/sci.2017.4485
The research of classical multidimensional knapsack problem always assumes that the weights,<br />the values and the capacities are constant values. However, in the real-life industrial engineering applica-<br />tions, the multidimensional knapsack problem often comes with uncertainty for lacking of the information<br />about these parameters. This paper investigates a constrained multidimensional knapsack problem under<br />uncertain environment, in which the relevant parameters are assumed to be uncertain variables. Within<br />the framework of uncertainty theory, two types of uncertain programming models with discount con-<br />straints are constructed for the problem with dierent decision criteria, i.e., the expected value criterion<br />and the critical value criterion. Taking full advantage of the operational law for uncertain variables, the<br />proposed models can be transformed into their corresponding deterministic models. After theoretically<br />investigating the properties of the models, we do some numerical experiments. The numerical results<br />illustrate that the proposed models are feasible and ecient for solving the constrained multidimensional<br />knapsack problem with uncertain parameters.
Multidimensional knapsack problem,Uncertain network optimization,Uncertain measure,Discount constraint
https://scientiairanica.sharif.edu/article_4485.html
https://scientiairanica.sharif.edu/article_4485_037bbad2ca12e83ee8047cf15871a171.pdf