2014
21
3
0
0
A hybrid meta-heuristic for balancing and scheduling assembly lines with sequence-independent Setup times by considering deterioration tasks and learning effect
A hybrid meta-heuristic for balancing and scheduling assembly lines with sequence-independent Setup times by considering deterioration tasks and learning effect
2
2
This paper addresses the Simple Assembly Line Balancing Problem of type II (SALBP-II), with Simultaneous eects of deterioration and learning in which there are sequence-independent setup times relating to each task. In many real industrial environments, although the actual task processing times are dened as a function of their starting times due to deterioration eects, workstations improve continuously as a result of repeating the same activities by worker(s) or machine(s). In this paper, a mathematical model is developed for this novel problem, attempting to minimize the cycle time for a given number of workstations. In addition to the balancing of the assembly line, the developed model presents the execution scheduling of tasks assigned to each workstation. Moreover, a hybrid meta-heuristic method is proposed to solve such an NP-hard problem. This robust and simply structured solution approach uses the tabu search within the Variable Neighbourhood Search (VNS/TS). The computational experiments and comparison with a Dierential Evolution Algorithm (DEA) re ect the high eciency of our proposed algorithm for a number of well-known instances.
1
This paper addresses the Simple Assembly Line Balancing Problem of type II (SALBP-II), with Simultaneous eects of deterioration and learning in which there are sequence-independent setup times relating to each task. In many real industrial environments, although the actual task processing times are dened as a function of their starting times due to deterioration eects, workstations improve continuously as a result of repeating the same activities by worker(s) or machine(s). In this paper, a mathematical model is developed for this novel problem, attempting to minimize the cycle time for a given number of workstations. In addition to the balancing of the assembly line, the developed model presents the execution scheduling of tasks assigned to each workstation. Moreover, a hybrid meta-heuristic method is proposed to solve such an NP-hard problem. This robust and simply structured solution approach uses the tabu search within the Variable Neighbourhood Search (VNS/TS). The computational experiments and comparison with a Dierential Evolution Algorithm (DEA) re ect the high eciency of our proposed algorithm for a number of well-known instances.
963
979
N.
Hamta
N.
Hamta
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran
Department of Industrial Engineering, Amirkabir
Iran
S.M.T.
Fatemi Ghomi
S.M.T.
Fatemi Ghomi
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran
Department of Industrial Engineering, Amirkabir
Iran
fatemi@aut.ac.ir
R.
Tavakkoli-Moghaddam
R.
Tavakkoli-Moghaddam
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Department of Industrial Engineering, College
Iran
tavakoli@ut.ac.ir
F.
Jolai
F.
Jolai
Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
Department of Industrial Engineering, College
Iran
gmzvcalo@scientiaunknown.non
Assembly line balancing
Scheduling
Deterioration tasks
Learning eect
Hybrid meta-heuristic
Sequence-independent setup times
Scaling implementation of the tension rectification algorithm to solve the feasible differential problem 888
Scaling implementation of the tension rectification algorithm to solve the feasible differential problem 888
2
2
The feasible differential problem is solved using the tension rectification algorithm. In this paper, we present a scaling mplementation of the tension rectification algorithm. Let n, m,U denote the number of nodes, number of arcs, and maximum arc capacity value of an arc, respectively. Our implementation runs in O(mnlog U), which is O(mnlog n) under the similarity assumption. The tension rectification algorithm runs in O(m2) time, so our implementation is an improvement if n log n
1
The feasible differential problem is solved using the tension rectification algorithm. In this paper, we present a scaling mplementation of the tension rectification algorithm. Let n, m,U denote the number of nodes, number of arcs, and maximum arc capacity value of an arc, respectively. Our implementation runs in O(mnlog U), which is O(mnlog n) under the similarity assumption. The tension rectification algorithm runs in O(m2) time, so our implementation is an improvement if n log n
980
987
Mehdi
Ghiyasvand
Mehdi
Ghiyasvand
Department of Mathematics, Faculty of Science,Bu-Ali Sina University, Hamedan, Iran
Department of Mathematics, Faculty of Science,Bu-A
Iran
mghiyasvand@basu.ac.ir
Operations research
Network flows
The feasible differential problem
Tension rectification algorithm
Scaling implementation
Network design of a decentralized distribution supply chain: Analysis of non-cooperative equilibrium vs. coordination with discount or buyback mechanism
Network design of a decentralized distribution supply chain: Analysis of non-cooperative equilibrium vs. coordination with discount or buyback mechanism
2
2
This paper develops a model for illustrating how a manufacturer can use his initiative to organize the retailers when they take decisions as independent actors. The candidate retailers are able to distribute product over geographical dispersed markets with stochastic demands. Each manufacturer’s decision about selecting a set of retailers results in a unique distribution network design. Taking transportation and inventory costs into account, each candidate retailer determines order quantity to satisfy markets’ demands, while the manufacturer specifies wholesale price pursuing uniform or retailer-specific pricing polices depending on trade legislations. In this single period problem and under mild assumptions on demands distributions, we show a non-cooperative equilibrium exists for each distribution network design. We also propose distinctive coordination mechanisms corresponding to the pricing policies. Using these mechanisms in each design of the distribution network, profits of the manufacturer and retailers are better off compared to the non-cooperative situation. Lastly, numerical examples presented in the paper, comprising the sensitivity analysis of some key parameters, seek to compare the results of different distribution network designs under various pricing policies and yield some applicable managerial insights.
1
This paper develops a model for illustrating how a manufacturer can use his initiative to organize the retailers when they take decisions as independent actors. The candidate retailers are able to distribute product over geographical dispersed markets with stochastic demands. Each manufacturer’s decision about selecting a set of retailers results in a unique distribution network design. Taking transportation and inventory costs into account, each candidate retailer determines order quantity to satisfy markets’ demands, while the manufacturer specifies wholesale price pursuing uniform or retailer-specific pricing polices depending on trade legislations. In this single period problem and under mild assumptions on demands distributions, we show a non-cooperative equilibrium exists for each distribution network design. We also propose distinctive coordination mechanisms corresponding to the pricing policies. Using these mechanisms in each design of the distribution network, profits of the manufacturer and retailers are better off compared to the non-cooperative situation. Lastly, numerical examples presented in the paper, comprising the sensitivity analysis of some key parameters, seek to compare the results of different distribution network designs under various pricing policies and yield some applicable managerial insights.
988
1006
Ashkan
Hafezalkotob
Ashkan
Hafezalkotob
Department of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
Department of Industrial Engineering, Islamic
Iran
a_hafez@azad.ac.ir
Ahmad
Makui
Ahmad
Makui
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
Department of Industrial Engineering, Iran
Iran
amakui@iust.ac.ir
Distribution network design, Game theory
Multi-location newsvendors
supply chain coordination
Buy back contract
An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem
An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem
2
2
In previous investigations in the field of flexible flow shop scheduling problem, rework probability for operations was ignored. As these kinds of problems are NP-hard, so we presented an enhanced invasive weed optimization (EIWO) meta-heuristic algorithm in order to solve the addressed problem with probable rework times, transportation times with a conveyor between two subsequent stages, different ready times and anticipatory sequence dependent setup times. The optimization criterion is to minimize makespan. Although invasive weed optimization (IWO) is an efficient algorithm and has been attracted by many researchers recently, but to increase the capability of IWO, we added mutation operation to enhance the exploration in order to prevent sticking in local optimum. In addition, affinity function is embedded to obstruct premature convergence. With these changes, we balance exploration and exploitation of IWO. Since, the performance of our proposed algorithm depends on parameters values, hence, we applied a popular design of experimental methodology called response surface method (RSM). To evaluate the proposed algorithm, first some random test problems were generated and compared with three benchmark algorithms. The related results were analyzed by statistical tools. The experimental results and statistical analyses demonstrated that the proposed EIWO was effective for the problem.
1
In previous investigations in the field of flexible flow shop scheduling problem, rework probability for operations was ignored. As these kinds of problems are NP-hard, so we presented an enhanced invasive weed optimization (EIWO) meta-heuristic algorithm in order to solve the addressed problem with probable rework times, transportation times with a conveyor between two subsequent stages, different ready times and anticipatory sequence dependent setup times. The optimization criterion is to minimize makespan. Although invasive weed optimization (IWO) is an efficient algorithm and has been attracted by many researchers recently, but to increase the capability of IWO, we added mutation operation to enhance the exploration in order to prevent sticking in local optimum. In addition, affinity function is embedded to obstruct premature convergence. With these changes, we balance exploration and exploitation of IWO. Since, the performance of our proposed algorithm depends on parameters values, hence, we applied a popular design of experimental methodology called response surface method (RSM). To evaluate the proposed algorithm, first some random test problems were generated and compared with three benchmark algorithms. The related results were analyzed by statistical tools. The experimental results and statistical analyses demonstrated that the proposed EIWO was effective for the problem.
1007
1020
Fariborz
Jolai
Fariborz
Jolai
Department of Industrial Engineering, University of Tehran, Tehran, Iran
Department of Industrial Engineering, University
Iran
fjolai@ut.ac.ir
Reza
Tavakkoli-Moghaddam
Reza
Tavakkoli-Moghaddam
Department of Industrial Engineering, University of Tehran, Tehran, Iran
Department of Industrial Engineering, University
Iran
tavakoli@ut.ac.ir
M.
Rabiee
M.
Rabiee
Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran
Department of Industrial Engineering, K.
Iran
meysam_rabiee@basu.ac.ir
E.
Gheisariha
E.
Gheisariha
Department of Industrial Engineering, University of Tehran, Kish Int’l Campus, Iran
Department of Industrial Engineering, University
Iran
gheisariha.e@gmail.com
IWO
Flexible flow shop
Response surface methodology
rework
transportation time
anticipatory sequence dependent setup time
A Particle Swarm Optimization-based Algorithm for Flexible Assembly Job Shop Scheduling Problem with Sequence Dependent Setup Times
A Particle Swarm Optimization-based Algorithm for Flexible Assembly Job Shop Scheduling Problem with Sequence Dependent Setup Times
2
2
Abstract This paper considers a flexible assembly job shop scheduling problem with the sequence dependent setup times, and its objective is minimization of makespan which integrates the process planning and scheduling activities. This is a combinatorial optimization problem with substantially large solution space, suggesting that it is highly difficult to find the best solution with the exact search method. In this paper a particle swarm optimization based algorithm is proposed which applies a novel solution representation method to fit the continuous nature of algorithm in the discrete modeled problem. The numerical experiments also have been performed to demonstrate the effectiveness of the proposed algorithm.
1
Abstract This paper considers a flexible assembly job shop scheduling problem with the sequence dependent setup times, and its objective is minimization of makespan which integrates the process planning and scheduling activities. This is a combinatorial optimization problem with substantially large solution space, suggesting that it is highly difficult to find the best solution with the exact search method. In this paper a particle swarm optimization based algorithm is proposed which applies a novel solution representation method to fit the continuous nature of algorithm in the discrete modeled problem. The numerical experiments also have been performed to demonstrate the effectiveness of the proposed algorithm.
1021
1033
Saeid
Nourali
Saeid
Nourali
Faculty of Management & Accounting, Department of Industrial Management, Islamic Azad University South Tehran Branch, Tehran, Iran
Faculty of Management & Accounting, Department
Iran
st_s_nourali@azad.ac.ir
Narges
Imanipour
Narges
Imanipour
Faculty of Entrepreneurship, University of Tehran, Tehran, Iran
Faculty of Entrepreneurship, University of
Iran
nimanip@ut.ac.ir
Flexible job shop scheduling
assembly
sequence dependent setup time
Particle swarm optimization
Risk analysis of sourcing problem using stochastic programming
Risk analysis of sourcing problem using stochastic programming
2
2
Nowadays Sourcing problemhas become more challenging for supply chain members. Different types of sourcing for different market conditions are presented in the literature. In this paper an option contract as an efficient tool for sourcing is developed in a multi-period setting in which the price and demand follow two stochastic processes. Sourcing decision is analyzed from risk neutral and risk averse decision maker’s point of view. This paper applies the stochastic programming approach to model the presented option contract based on price and demand uncertainties. Next, using CVaR as a coherent risk measure, the effects of risk on sourcing problem are studied. By numerical example, using the presented efficient frontier, the simulation results of our developed models show that the decision maker can make a trade-off between risk and cost associated with the sourcing problem. The paper also performs sensitivity analysis in order to demonstrate the effects of change in cost parameter on results of our option model.
1
Nowadays Sourcing problemhas become more challenging for supply chain members. Different types of sourcing for different market conditions are presented in the literature. In this paper an option contract as an efficient tool for sourcing is developed in a multi-period setting in which the price and demand follow two stochastic processes. Sourcing decision is analyzed from risk neutral and risk averse decision maker’s point of view. This paper applies the stochastic programming approach to model the presented option contract based on price and demand uncertainties. Next, using CVaR as a coherent risk measure, the effects of risk on sourcing problem are studied. By numerical example, using the presented efficient frontier, the simulation results of our developed models show that the decision maker can make a trade-off between risk and cost associated with the sourcing problem. The paper also performs sensitivity analysis in order to demonstrate the effects of change in cost parameter on results of our option model.
1034
1043
M.
Keyvanloo
M.
Keyvanloo
Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, 424 Hafez Avenue, Postal Code: 1591634311, Tehran, Iran
Department of Industrial Engineering and
Iran
m_keyvanloo@aut.ac.ir
A.M.
Kimiagari
A.M.
Kimiagari
Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, 424 Hafez Avenue, Postal Code: 1591634311, Tehran, Iran
Department of Industrial Engineering and
Iran
kimiagar@aut.ac.ir
A.
Esfahanipour
A.
Esfahanipour
Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, 424 Hafez Avenue, Postal Code: 1591634311, Tehran, Iran
Department of Industrial Engineering and
Iran
Supply Contract
Risk measure
Efficient frontier
Option contract
Uncertain demand
Uncertain price
stochastic process
Stochastic programming
Using group method of data handling to model customer choice behaviour
Using group method of data handling to model customer choice behaviour
2
2
Choice modelling is valuable for understanding and predicting customer behaviour. This study introduces the Group Method of Data Handling (GMDH) into choice modelling and applies this new technique to model consumer choice in the longdistance communication market. When we compare the GMDH with the Articial Neural Network (ANN) and logit models, the results show that the new model provides better predictions of customer choice than the ANN and logit models. In addition, the new model can identify the important explanatory variables that aect customer choice, and reveal how the variables aect this choice, which cannot be directly accomplished using the ANN model. This advantage will help rms to better analyse the behaviour of their customers and, thereby, develop suitable marketing strategies.
1
Choice modelling is valuable for understanding and predicting customer behaviour. This study introduces the Group Method of Data Handling (GMDH) into choice modelling and applies this new technique to model consumer choice in the longdistance communication market. When we compare the GMDH with the Articial Neural Network (ANN) and logit models, the results show that the new model provides better predictions of customer choice than the ANN and logit models. In addition, the new model can identify the important explanatory variables that aect customer choice, and reveal how the variables aect this choice, which cannot be directly accomplished using the ANN model. This advantage will help rms to better analyse the behaviour of their customers and, thereby, develop suitable marketing strategies.
1051
1060
B.
Zhu
B.
Zhu
Business School, Sichuan University, No. 24 South Section 1, Yihuan Road, Chengdu 610065, China
Business School, Sichuan University, No.
Iran
zhubing1866@hotmail.com
C.H.
He
C.H.
He
Business School, Sichuan University, No. 24 South Section 1, Yihuan Road, Chengdu 610065, China
Business School, Sichuan University, No.
Iran
Y.
Niu
Y.
Niu
Business School, Sichuan University, No. 24 South Section 1, Yihuan Road, Chengdu 610065, China.
Business School, Sichuan University, No.
Iran
Choice modelling
Group Method of Data Handling (GMDH)
Articial Neural Network (ANN)
Long- Distance communication mode
On Competence of Vendor Managed Inventory in Supply Chains Using Basic Mathematical Inventory Models
On Competence of Vendor Managed Inventory in Supply Chains Using Basic Mathematical Inventory Models
2
2
In this study a two-echelon single-vendor supply chain is selected to do a cost-based comparison between short-term performances of vendor managed inventory (VMI) and retailer managed inventory (RMI) while the inventory cost includes ordering and storing expenses; rate of consumption and price of good are constant; rate of production and pace of transportation are infinite and shortage is not allowed. The paper after a comprehensive literature review is followed by three cases of single retailer, -retailer and two-retailer chains. Unlike the second case, in the first case, VMI shows an absolute superiority to RMI and this is the reason of devising the third case in which a deeper analysis, including a typical performance assessment system for two-retailer chains, is done. The third case reveals that although VMI is not always the better choice but in most of conditions it can be chosen as the better approach
1
In this study a two-echelon single-vendor supply chain is selected to do a cost-based comparison between short-term performances of vendor managed inventory (VMI) and retailer managed inventory (RMI) while the inventory cost includes ordering and storing expenses; rate of consumption and price of good are constant; rate of production and pace of transportation are infinite and shortage is not allowed. The paper after a comprehensive literature review is followed by three cases of single retailer, -retailer and two-retailer chains. Unlike the second case, in the first case, VMI shows an absolute superiority to RMI and this is the reason of devising the third case in which a deeper analysis, including a typical performance assessment system for two-retailer chains, is done. The third case reveals that although VMI is not always the better choice but in most of conditions it can be chosen as the better approach
1061
1071
Milad
Jasemi
Milad
Jasemi
Department of Industrial Engineering, Islamic Azad University, Masjed Soleyman Branch, Masjed Soleyman, Iran
Department of Industrial Engineering, Islamic
Iran
miladj@aut.ac.ir
Alireza
Haji
Alireza
Haji
Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran
Department of Industrial Engineering, Sharif
Iran
ahaji@sharif.edu
Moslem
Gharibi
Moslem
Gharibi
Department of Industrial Engineering, Islamic Azad University, Masjed Soleyman Branch, Masjed Soleyman, Iran
Department of Industrial Engineering, Islamic
Iran
Inventory control
vendor managed inventory
Retailer Managed Inventory
Supply chain management
A four-phase algorithm to improve reliability in series-parallel systems with redundancy allocation
A four-phase algorithm to improve reliability in series-parallel systems with redundancy allocation
2
2
In general, reliability is the ability of a system to perform and maintain its functions in routine, as well as hostile or unexpected, circumstances. The Redundancy Allocation Problem (RAP) is a combinatorial problem which maximizes system reliability by discrete simultaneous selection from available components. The main purpose of this study is to develop an eective approach to solve RAP, expeditiously. In this study, the basic assumption is considering Erlang distribution density for component failure rates. Another assumption is that each subsystem can have one of coldstandby or active redundancy strategies. The RAP is a NP-Hard problem which cannot be solved in reasonable time using exact optimization techniques. Therefore, an approach that combines an Ant Colony Optimization (ACO) algorithm as a meta-heuristic phase, and three other heuristics, is used to develop a solving methodology for RAP. Finally, to prove the eciency of the proposed approach, some well-known benchmarks in the literature are solved and discussed in detail.
1
In general, reliability is the ability of a system to perform and maintain its functions in routine, as well as hostile or unexpected, circumstances. The Redundancy Allocation Problem (RAP) is a combinatorial problem which maximizes system reliability by discrete simultaneous selection from available components. The main purpose of this study is to develop an eective approach to solve RAP, expeditiously. In this study, the basic assumption is considering Erlang distribution density for component failure rates. Another assumption is that each subsystem can have one of coldstandby or active redundancy strategies. The RAP is a NP-Hard problem which cannot be solved in reasonable time using exact optimization techniques. Therefore, an approach that combines an Ant Colony Optimization (ACO) algorithm as a meta-heuristic phase, and three other heuristics, is used to develop a solving methodology for RAP. Finally, to prove the eciency of the proposed approach, some well-known benchmarks in the literature are solved and discussed in detail.
1072
1082
A.
Ghafarian Salehi Nezhad
A.
Ghafarian Salehi Nezhad
Department of Industrial Engineering, Sharif University of Technology, Tehran, P.O. Box 14588-89694, Iran
Department of Industrial Engineering, Sharif
Iran
A.
Eshraghniaye Jahromi
A.
Eshraghniaye Jahromi
Department of Industrial Engineering, Sharif University of Technology, Tehran, P.O. Box 14588-89694, Iran.
Department of Industrial Engineering, Sharif
Iran
eshragh@sharif.edu
M.H.
Salmani
M.H.
Salmani
Department of Industrial Engineering, Sharif University of Technology, Tehran, P.O. Box 14588-89694, Iran
Department of Industrial Engineering, Sharif
Iran
F.
Ghasemi
F.
Ghasemi
Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, P.O. Box 15875-4413, Iran.
Department of Industrial Engineering and
Iran
Reliability optimization
Redundancy allocation
series-parallel system
Ant colony optimization
Heuristic algorithms
Parameter design
Taguchi approach
A two-phase method for a multi-skilled project scheduling problem with discounted cash flows
A two-phase method for a multi-skilled project scheduling problem with discounted cash flows
2
2
This paper considers a multi-skilled project scheduling problem that is a newly developed extension of the resource-constrained project scheduling problem (RCPSP). The main difference in such problems compared with the classic scheduling problems is associated with the given resources, which are just depended on the human type. Additionally, the net present value of a given project is considered by the cash in and outflows to guarantee the project success. To solve the given problem, an enhanced two-phase method is proposed using the genetic and path relinking algorithms, whose parameters are tuned by the Taguchi method to provide robust comparisons. Furthermore, the potential changes in the project execution method are considered for some of the mostly used payment methods. Finally, some different-sized instances are tested to check the performance and efficiency of the proposed method.
1
This paper considers a multi-skilled project scheduling problem that is a newly developed extension of the resource-constrained project scheduling problem (RCPSP). The main difference in such problems compared with the classic scheduling problems is associated with the given resources, which are just depended on the human type. Additionally, the net present value of a given project is considered by the cash in and outflows to guarantee the project success. To solve the given problem, an enhanced two-phase method is proposed using the genetic and path relinking algorithms, whose parameters are tuned by the Taguchi method to provide robust comparisons. Furthermore, the potential changes in the project execution method are considered for some of the mostly used payment methods. Finally, some different-sized instances are tested to check the performance and efficiency of the proposed method.
1083
1095
B.H.
Tabrizi
B.H.
Tabrizi
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
School of Industrial Engineering, College
Iran
R.
Tavakkoli-Moghaddam
R.
Tavakkoli-Moghaddam
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
School of Industrial Engineering, College
Iran
tavakoli@ut.ac.ir
S.F.
Ghaderi
S.F.
Ghaderi
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
School of Industrial Engineering, College
Iran
Multi-skilled project scheduling problem
Cash flows
genetic algorithm
Path relinking algorithm
Economic-statistical design of adaptive X-bar control chart: a Taguchi loss function approach
Economic-statistical design of adaptive X-bar control chart: a Taguchi loss function approach
2
2
Along with the widespread use of Taguchi methods in product design, denition of the loss function has been integrated with numerous models which require quality cost estimation. In this paper, the economic-statistical design of a variable sampling X-bar control chart is extended using the Taguchi loss function to improve chart effectiveness from a quality cost point of view. The effectiveness of the proposed schemes is evaluated by comparing optimal expected costs and statistical performance with each other and with the xed sampling policy. Results indicate a satisfactory performance for the proposed models.
1
Along with the widespread use of Taguchi methods in product design, denition of the loss function has been integrated with numerous models which require quality cost estimation. In this paper, the economic-statistical design of a variable sampling X-bar control chart is extended using the Taguchi loss function to improve chart effectiveness from a quality cost point of view. The effectiveness of the proposed schemes is evaluated by comparing optimal expected costs and statistical performance with each other and with the xed sampling policy. Results indicate a satisfactory performance for the proposed models.
1096
1104
F.
Amiri
F.
Amiri
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, 1684613114, Iran
Department of Industrial Engineering, Iran
Iran
nzbqssvu@scientiaunknown.non
K.
Noghondarian
K.
Noghondarian
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, 1684613114, Iran.
Department of Industrial Engineering, Iran
Iran
Rassoul
Noorossana
Rassoul
Noorossana
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, 1684613114, Iran.
Department of Industrial Engineering, Iran
Iran
Adaptive control chart
Variable sample size
Variable sampling interval
Taguchi loss function
Economic-statistical design
Developing functional process capability indices for simple linear prole
Developing functional process capability indices for simple linear profile
2
2
A prole is a relation between one response variable and one or more explanatory variables that represent the quality of a product or the performance of a process. Process Capability Indices (PCI) are measured to evaluate processes in producing conforming products. All existing methods that measure process capability indices in a simple linear prole consider response variables at some levels of explanatory variable and ignore all ranges of x-values. In this paper, a functional approach is proposed to measure the process capability index of simple linear proles in all ranges of explanatory variable. This new approach follows the traditional denition of process capability indices and leads to their accurate values for a simple linear prole. The functional approach uses a reference prole, functional specication limits and functional natural tolerance limits to present a functional form of process capability indices. This functional form results in measuring the process capability at each level of the explanatory variable in a simple linear prole, as well as the unique value of a process capability index for a simple linear prole. A comparison study using a non-conforming proportion method shows the better performance of functional process capability indices in measuring the process capability in a simple linear prole.
1
A profile is a relation between one response variable and one or more explanatory variables that represent the quality of a product or the performance of a process. Process Capability Indices (PCI) are measured to evaluate processes in producing conforming products. All existing methods that measure process capability indices in a simple linear prole consider response variables at some levels of explanatory variable and ignore all ranges of x-values. In this paper, a functional approach is proposed to measure the process capability index of simple linear proles in all ranges of explanatory variable. This new approach follows the traditional denition of process capability indices and leads to their accurate values for a simple linear prole. The functional approach uses a reference prole, functional specication limits and functional natural tolerance limits to present a functional form of process capability indices. This functional form results in measuring the process capability at each level of the explanatory variable in a simple linear prole, as well as the unique value of a process capability index for a simple linear prole. A comparison study using a non-conforming proportion method shows the better performance of functional process capability indices in measuring the process capability in a simple linear profile.
1096
1104
R.
Nemati Keshteli
R.
Nemati Keshteli
Department of Industrial Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
Department of Industrial Engineering, Faculty
Iran
r.nemati@modares.ac.ir
R.
Baradaran Kazemzadeh
R.
Baradaran Kazemzadeh
Department of Industrial Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
Department of Industrial Engineering, Faculty
Iran
A.
Amiri
A.
Amiri
Department of Industrial Engineering, Shahed University, Tehran, Iran.
Department of Industrial Engineering, Shahed
Iran
a_amiri@modares.ac.ir
R.
Noorossana
R.
Noorossana
Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran.
Department of Industrial Engineering, Iran
Iran
cypzpilj@scientiaunknown.non
Prole monitoring
Simple linear prole
Functional process capability index
Specication limits
Natural tolerance limits
Research on the Stochastic Hybrid Multi-attribute Decision Making Method Based on Prospect Theory
Research on the Stochastic Hybrid Multi-attribute Decision Making Method Based on Prospect Theory
2
2
With respect to the stochastic hybrid multi-attribute decision making problems with interval probability and unknown attribute weight, a multi-attribute decision making method based on prospect theory is proposed. To begin with, the hybrid attribute vales, including real numbers, interval numbers, triangular fuzzy numbers, linguistic variables, uncertain linguistic variables and intuitionistic fuzzy values, are converted to trapezoidal fuzzy numbers, and intervalprobability is expressed by trapezoidal fuzzyprobability; the prospectvalue function of the trapezoidal fuzzy numbers for every alternative under every attribute and everynatural state based on the decision-making reference point of each attribute, and the weight function of trapezoidal fuzzyprobability,can be constructed; then the prospect value of attribute for every alternative is calculated through prospectvalue function and the weight function. Then, a maximizing deviation method is used to determine the attribute weightsand the weighted prospect value of alternative is get by weighting the prospect values, and all the alternatives are ranked according to the expected values of the weighted prospect values. Finally, an illustrate example is given to show the decision-making steps, the influence on decision making for different parameter values in value function and weight function and different decision-making reference points. ing
1
With respect to the stochastic hybrid multi-attribute decision making problems with interval probability and unknown attribute weight, a multi-attribute decision making method based on prospect theory is proposed. To begin with, the hybrid attribute vales, including real numbers, interval numbers, triangular fuzzy numbers, linguistic variables, uncertain linguistic variables and intuitionistic fuzzy values, are converted to trapezoidal fuzzy numbers, and intervalprobability is expressed by trapezoidal fuzzyprobability; the prospectvalue function of the trapezoidal fuzzy numbers for every alternative under every attribute and everynatural state based on the decision-making reference point of each attribute, and the weight function of trapezoidal fuzzyprobability,can be constructed; then the prospect value of attribute for every alternative is calculated through prospectvalue function and the weight function. Then, a maximizing deviation method is used to determine the attribute weightsand the weighted prospect value of alternative is get by weighting the prospect values, and all the alternatives are ranked according to the expected values of the weighted prospect values. Finally, an illustrate example is given to show the decision-making steps, the influence on decision making for different parameter values in value function and weight function and different decision-making reference points. ing
1105
1119
Hongliang
Yu
Hongliang
Yu
School of Economics and Management, Shandong University of Science and Technology, Qingdao 266590, China
School of Economics and Management, Shandong
Iran
Peide
Liu
Peide
Liu
School of Management Science and Engineering, Shandong University of Finance and Economics, Jinan Shandong 250014, China
School of Management Science and Engineering,
Iran
peide.liu@gmail.com
Fang
Jin
Fang
Jin
School of Management Science and Engineering, Shandong University of Finance and Economics, Jinan Shandong 250014, China
School of Management Science and Engineering,
Iran
Prospect Theory
intervalprobability
uncertain linguistic variables
hybrid Decision making
stochastic decision-making
multi-attribute decision-mak
A master production schedule warning approach for cement equipment manufacturing enterprises
A master production schedule warning approach for cement equipment manufacturing enterprises
2
2
Reducing product delivery time is a key factor for enterprises in increasing their core competitiveness. In order to resolve problems, including lack of a warning and monitoring system for Master Production Schedules (MPS) in cement equipment manufacturing enterprises, we propose a warning echanism based on theoretical nish percentage and actual nish percentage. First, an MPS model, based on the product Manufacturing Bill Of the Material (MBOM), is proposed. Second, we present an approach for generating planned time, actual time, actual nish percentage and theoretical nish percentage, and yellow and red warnings are introduced to evaluate whether the production plan is normal or not. Finally, we use an example to illustrate the proposed algorithm process. Experimental results have shown that the proposed approach is able to support MPS warning.
1
Reducing product delivery time is a key factor for enterprises in increasing their core competitiveness. In order to resolve problems, including lack of a warning and monitoring system for Master Production Schedules (MPS) in cement equipment manufacturing enterprises, we propose a warning echanism based on theoretical nish percentage and actual nish percentage. First, an MPS model, based on the product Manufacturing Bill Of the Material (MBOM), is proposed. Second, we present an approach for generating planned time, actual time, actual nish percentage and theoretical nish percentage, and yellow and red warnings are introduced to evaluate whether the production plan is normal or not. Finally, we use an example to illustrate the proposed algorithm process. Experimental results have shown that the proposed approach is able to support MPS warning.
1120
1127
L.B.
Sun
L.B.
Sun
School of Mechanic and Electronic Engineering, Wuhan University of Technology, Wuhan, 430070, China.
School of Mechanic and Electronic Engineering,
Iran
S.S.
Guo
S.S.
Guo
School of Mechanic and Electronic Engineering, Wuhan University of Technology, Wuhan, 430070, China.
School of Mechanic and Electronic Engineering,
Iran
S.Q.
Tao
S.Q.
Tao
School of Mechanic and Electronic Engineering, Wuhan University of Technology, Wuhan, 430070, China.
School of Mechanic and Electronic Engineering,
Iran
Y.B.
Li
Y.B.
Li
School of Mechanic and Electronic Engineering, Wuhan University of Technology, Wuhan, 430070, China
School of Mechanic and Electronic Engineering,
Iran
B.G.
Du
B.G.
Du
School of Mechanic and Electronic Engineering, Wuhan University of Technology, Wuhan, 430070, China
School of Mechanic and Electronic Engineering,
Iran
MPS
MBOM
Yellow warning
Red warning