Pub Date : 2013-12-01DOI: 10.1109/IEEM.2013.6962504
D. C. Wimalachandra, B. Frank, T. Enkawa
The present article addresses how different types of B2B customer involvement motives and B2C customer involvement motives affect different dimensions of new product development (NPD) operational performance in the B2B context. This study also explores the moderating effects of high vs. low product technology on the relationships between different types of customer involvement motives and different dimensions of NPD operational performance. Based on data collected from the textile and apparel industry in 10 countries, the current study illustrates that B2C customer involvement has a greater impact than B2B customer involvement on time-to-market. Nevertheless, B2B customer involvement plays an important role as it contributes more to quality than does B2C customer involvement. In addition, the study explains the different strategies that should be adopted in B2B and B2C customer involvement when high vs. low product technology is present.
{"title":"Enhancing NPD operational performance through B2B and B2C customer involvement for varying degrees of product technology","authors":"D. C. Wimalachandra, B. Frank, T. Enkawa","doi":"10.1109/IEEM.2013.6962504","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962504","url":null,"abstract":"The present article addresses how different types of B2B customer involvement motives and B2C customer involvement motives affect different dimensions of new product development (NPD) operational performance in the B2B context. This study also explores the moderating effects of high vs. low product technology on the relationships between different types of customer involvement motives and different dimensions of NPD operational performance. Based on data collected from the textile and apparel industry in 10 countries, the current study illustrates that B2C customer involvement has a greater impact than B2B customer involvement on time-to-market. Nevertheless, B2B customer involvement plays an important role as it contributes more to quality than does B2C customer involvement. In addition, the study explains the different strategies that should be adopted in B2B and B2C customer involvement when high vs. low product technology is present.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"70 1","pages":"714-718"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86855093","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962493
N. Somsuk, P. Pongpanich, S. Teekasap
This paper aims to identify a common set of drivers of green supply chain management (GSCM) which affects sustainable competitive advantages of firms in supply chains, with respect to the specific internal and relational resources of the firm, and to classify these drivers into consensus categories. In this paper, drivers were identified based on a literature review through the lens of two strategic management theories of competitive advantage: resource-based and relational views. After the literature review, three categories of resource-based drivers were identified. The Q-sort method was then applied to classifying these drivers into categories according to the experts' opinions for the purpose of evoking group consensus on the classifications. The results of this study will be used to develop a theoretical framework and a hierarchical decision making model for the prioritization of these drivers in further research.
{"title":"Determining and classifying drivers of sustainable competitive advantages in green supply chain management: Resource-based and relational views","authors":"N. Somsuk, P. Pongpanich, S. Teekasap","doi":"10.1109/IEEM.2013.6962493","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962493","url":null,"abstract":"This paper aims to identify a common set of drivers of green supply chain management (GSCM) which affects sustainable competitive advantages of firms in supply chains, with respect to the specific internal and relational resources of the firm, and to classify these drivers into consensus categories. In this paper, drivers were identified based on a literature review through the lens of two strategic management theories of competitive advantage: resource-based and relational views. After the literature review, three categories of resource-based drivers were identified. The Q-sort method was then applied to classifying these drivers into categories according to the experts' opinions for the purpose of evoking group consensus on the classifications. The results of this study will be used to develop a theoretical framework and a hierarchical decision making model for the prioritization of these drivers in further research.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"1 1","pages":"655-660"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88114984","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962526
K. Bhattacharjee, R. Shankar, M. Gupta
In this paper the status of knowledge transfer at an premier Indian Institute of Higher Learning in Technology (IHLT) have been portrayed. Smooth knowledge transfer helps in better understanding of the subject and it helps in achieving administrative and academic efficiency. An questionnaire-based survey has been done where responses of 922 UG students have been analyzed to ascertain the extent to which knowledge transfer is successful in IHLT.
{"title":"Knowledge transfer practices at Indian premier Institute of Higher Learning in Technology","authors":"K. Bhattacharjee, R. Shankar, M. Gupta","doi":"10.1109/IEEM.2013.6962526","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962526","url":null,"abstract":"In this paper the status of knowledge transfer at an premier Indian Institute of Higher Learning in Technology (IHLT) have been portrayed. Smooth knowledge transfer helps in better understanding of the subject and it helps in achieving administrative and academic efficiency. An questionnaire-based survey has been done where responses of 922 UG students have been analyzed to ascertain the extent to which knowledge transfer is successful in IHLT.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"85 1","pages":"823-827"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88233058","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962567
Birajashis Pattnaik, S. Tripathy
Process capability indices are useful tools, which provide common quantitative measures on manufacturing capability and production quality. The existing Multivariate Process Capability indices, Cpm, MCpm,[CpM, PV, LI], MCf & (sTpk} are proposed by different authors for different conditions and situations[1,2,3,4,5]. Many of the above multivariate process capability indices are based on the ratios of two areas or volumes for bivariate or in multivariate domain respectively. All above proposed indices assume the process to be normal and there by the indices are expressed in the form of ratios of areas of two ellipses or volume of two ellipsoids. When the process does not follow normal distribution the estimation of the index is difficult as the shape of the data distribution will be not known. The proposed MCsvdd index uses computational geometry and find out the convex hull of the process data to find the volume. Support Vector Data description helps to find the outliers.
{"title":"A computational geometric approach for a novel multivariate process capability index","authors":"Birajashis Pattnaik, S. Tripathy","doi":"10.1109/IEEM.2013.6962567","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962567","url":null,"abstract":"Process capability indices are useful tools, which provide common quantitative measures on manufacturing capability and production quality. The existing Multivariate Process Capability indices, Cpm, MCpm,[CpM, PV, LI], MCf & (sTpk} are proposed by different authors for different conditions and situations[1,2,3,4,5]. Many of the above multivariate process capability indices are based on the ratios of two areas or volumes for bivariate or in multivariate domain respectively. All above proposed indices assume the process to be normal and there by the indices are expressed in the form of ratios of areas of two ellipses or volume of two ellipsoids. When the process does not follow normal distribution the estimation of the index is difficult as the shape of the data distribution will be not known. The proposed MCsvdd index uses computational geometry and find out the convex hull of the process data to find the volume. Support Vector Data description helps to find the outliers.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"37 1","pages":"1031-1035"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88303138","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962399
Moussa Bagayoko, T. Dao, B. ATEME-NGUEMA
Forest vehicle routing is an important step in optimization of forest transportation system to minimize the total cost. To perform this work, we propose a mathematical model and use a reactive tabu search metaheuristic approach. The objective is to minimize the total cost by respecting the time window of all customers which is sometimes important in this field. Finally, the experimental results obtained with the reactive tabu search metaheuristic approach of the named vehicle routing problem is showed, and compared to its extended great deluge results.
{"title":"Optimization of forest vehicle routing using reactive tabu search metaheuristic","authors":"Moussa Bagayoko, T. Dao, B. ATEME-NGUEMA","doi":"10.1109/IEEM.2013.6962399","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962399","url":null,"abstract":"Forest vehicle routing is an important step in optimization of forest transportation system to minimize the total cost. To perform this work, we propose a mathematical model and use a reactive tabu search metaheuristic approach. The objective is to minimize the total cost by respecting the time window of all customers which is sometimes important in this field. Finally, the experimental results obtained with the reactive tabu search metaheuristic approach of the named vehicle routing problem is showed, and compared to its extended great deluge results.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"33 1","pages":"181-185"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82632015","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962419
António Almeida, A. Azevedo, Á. Caldas
Since the automotive industry is one of the most competitive markets, key players should be capable of evolving their management strategy from a reactive to proactive approach. This way, it is critical for this type of companies to explore a new performance management approach where an effective interaction between the strategic and operational layers should be achieved. In line with this vision, a framework is presented that helps stakeholders make decisions based on the ability to anticipate future performance behaviours. Using leading indicators as reference, the key idea is to structure and model the existing knowledge within a mathematical tool, in order to project the manufacturing system's behaviour into the future. In order to show the reliability and importance of this framework, this paper presents a research performed at an automotive plant. The aim is to model the factors affecting energy consumption and thus estimate the future behaviour in terms of sustainability issues.
{"title":"Prediction of energy consumption indices in the automotive industry","authors":"António Almeida, A. Azevedo, Á. Caldas","doi":"10.1109/IEEM.2013.6962419","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962419","url":null,"abstract":"Since the automotive industry is one of the most competitive markets, key players should be capable of evolving their management strategy from a reactive to proactive approach. This way, it is critical for this type of companies to explore a new performance management approach where an effective interaction between the strategic and operational layers should be achieved. In line with this vision, a framework is presented that helps stakeholders make decisions based on the ability to anticipate future performance behaviours. Using leading indicators as reference, the key idea is to structure and model the existing knowledge within a mathematical tool, in order to project the manufacturing system's behaviour into the future. In order to show the reliability and importance of this framework, this paper presents a research performed at an automotive plant. The aim is to model the factors affecting energy consumption and thus estimate the future behaviour in terms of sustainability issues.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"59 1","pages":"285-289"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91537632","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962622
Jaekyung Yang, ByoungJin Yu, Myoungjin Choi
Most of the clustering algorithms are affected by the number of attributes and instances with respect to the computation time. Thus, the data mining community has made efforts to enable induction of the clustering efficient. Hence, scalability is naturally a critical issue that the data mining community faces. A method to handle this issue is to use a subset of all instances. This paper suggests an algorithm that enables to perform clustering efficiently. This is done by using nested partitions method for solving the noisy performance problems, which arises when using a subset of instances and adjusting the sample rate properly at each iteration. This Adaptive NPCLUSTER algorithm had better similarity in small dataset and had worse similarity in large dataset than NPCLUSTER, but it had shorter computation time than NPCLUSTER.
{"title":"Scalable clustering with adaptive instance sampling","authors":"Jaekyung Yang, ByoungJin Yu, Myoungjin Choi","doi":"10.1109/IEEM.2013.6962622","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962622","url":null,"abstract":"Most of the clustering algorithms are affected by the number of attributes and instances with respect to the computation time. Thus, the data mining community has made efforts to enable induction of the clustering efficient. Hence, scalability is naturally a critical issue that the data mining community faces. A method to handle this issue is to use a subset of all instances. This paper suggests an algorithm that enables to perform clustering efficiently. This is done by using nested partitions method for solving the noisy performance problems, which arises when using a subset of instances and adjusting the sample rate properly at each iteration. This Adaptive NPCLUSTER algorithm had better similarity in small dataset and had worse similarity in large dataset than NPCLUSTER, but it had shorter computation time than NPCLUSTER.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"105 1","pages":"1309-1313"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90355325","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962409
Vatcharapol Sukhotu, Supachart Iamratanakul
Ideally, the aim of a retail store is single-trip in-store replenishment. In other words, a store worker should only need to make a single trip to fill the shelves after a product has been delivered to the store. This can be achieved if the size of the lot received is smaller than the shelf space minus the number of units left on the shelves at the time of shelf replenishment. In this paper, we introduce the consideration of the in-store handling cost for the second trip in an EOQ-type model to determine the optimal order quantity, given the available retail shelf space. Our model considers the case where products are ordered in multiple packs and one part of the distribution-handling cost is the cost per each pack handled. The insights gained from the model will help manufacturing managers, vendors and retail managers make better decisions with regard to the lot size produced, ordered, and delivered as part of an effective supply chain management strategy.
{"title":"An EOQ model with consideration of second-trip in-store replenishment","authors":"Vatcharapol Sukhotu, Supachart Iamratanakul","doi":"10.1109/IEEM.2013.6962409","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962409","url":null,"abstract":"Ideally, the aim of a retail store is single-trip in-store replenishment. In other words, a store worker should only need to make a single trip to fill the shelves after a product has been delivered to the store. This can be achieved if the size of the lot received is smaller than the shelf space minus the number of units left on the shelves at the time of shelf replenishment. In this paper, we introduce the consideration of the in-store handling cost for the second trip in an EOQ-type model to determine the optimal order quantity, given the available retail shelf space. Our model considers the case where products are ordered in multiple packs and one part of the distribution-handling cost is the cost per each pack handled. The insights gained from the model will help manufacturing managers, vendors and retail managers make better decisions with regard to the lot size produced, ordered, and delivered as part of an effective supply chain management strategy.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"9 1","pages":"231-235"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83710360","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962506
E. Mizutani
We consider the problem for scheduling N jobs that are partitioned to F disjoint classes (or families) subject to changeover (or setup) times in order to minimize the total weighted completion time. We first identify a published inefficient forward dynamic programming (DP) procedure due to Potts (1991) that works in O(F2NF+d), where d is the number of different changeover values (d ≤ F2). We then show how to make a forward DP progress in O(F2NF) by modifying the evaluation of stage costs. Although the posed scheduling problem is believed to be amenable to backward DP (rather than forward DP) in the literature, the resulting forward DP can work at least as efficiently as an existing (best-known) backward DP procedure. In other words, both forward and backward DPs can be rendered equally efficient when the definitions of states are changed appropriately for DP procedures. This is why DP formulations are often said to be quite an art.
{"title":"A note on dynamic programming formulations for scheduling job classes with changeover times on a single machine","authors":"E. Mizutani","doi":"10.1109/IEEM.2013.6962506","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962506","url":null,"abstract":"We consider the problem for scheduling N jobs that are partitioned to F disjoint classes (or families) subject to changeover (or setup) times in order to minimize the total weighted completion time. We first identify a published inefficient forward dynamic programming (DP) procedure due to Potts (1991) that works in O(F2NF+d), where d is the number of different changeover values (d ≤ F2). We then show how to make a forward DP progress in O(F2NF) by modifying the evaluation of stage costs. Although the posed scheduling problem is believed to be amenable to backward DP (rather than forward DP) in the literature, the resulting forward DP can work at least as efficiently as an existing (best-known) backward DP procedure. In other words, both forward and backward DPs can be rendered equally efficient when the definitions of states are changed appropriately for DP procedures. This is why DP formulations are often said to be quite an art.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"11 1","pages":"723-727"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83827607","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 : 2013-12-01DOI: 10.1109/IEEM.2013.6962407
X. Ma, P. Guo
This paper deals with the channel coordination problem in the supply chain for an innovative product. The partially known information about the demand is represented by a possibility distribution. Since the life cycle of the innovative product is short, how to determine the optimal order amount is a typical one-shot decision problem. With the one-shot decision theory, Stackelberg equilibriums are obtained for the optimal wholesale price of the manufacturer and the optimal order quantity of the retailer with price-only contract (asymmetric information) and returns (symmetric information). The channel coordination is achieved by using returns policies. The proposed models are scenario-based decision models which provide a fundamental alternative to analyze issues of channel coordination for innovative products.
{"title":"Optimal pricing and returns policies for innovative products with the one-shot decision theory","authors":"X. Ma, P. Guo","doi":"10.1109/IEEM.2013.6962407","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962407","url":null,"abstract":"This paper deals with the channel coordination problem in the supply chain for an innovative product. The partially known information about the demand is represented by a possibility distribution. Since the life cycle of the innovative product is short, how to determine the optimal order amount is a typical one-shot decision problem. With the one-shot decision theory, Stackelberg equilibriums are obtained for the optimal wholesale price of the manufacturer and the optimal order quantity of the retailer with price-only contract (asymmetric information) and returns (symmetric information). The channel coordination is achieved by using returns policies. The proposed models are scenario-based decision models which provide a fundamental alternative to analyze issues of channel coordination for innovative products.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"95 1","pages":"221-225"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79051176","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
扫码关注我们
求助内容：
应助结果提醒方式：