Pub Date : 2013-12-01DOI: 10.1109/IEEM.2013.6962703
M. Di Dio, R. Iannone, S. Miranda, S. Riemma
Aim of the present paper is to propose a framework for the choice of the opportunistic maintenance models for applications in real contexts. The paper explores firstly the scientific literature on opportunistic maintenance in order to obtain a multi-criteria classification of the main existing models. This allowed us to devise a methodological map for the selection and the choice of the opportunistic maintenance models. This map requires an accurate data collection, performed by the user, in order to assess which of the opportunistic maintenance models is able to more effectively address the problems of a specific facility and/or organization. The paper proposes, for the first time in the literature, a tool aimed at guiding experts and professionals in the field of maintenance among the multiple scientific approaches to opportunistic maintenance in relation to the objectives to be achieved, the relevant restrictions and the available information, also taking into account the complexity of implementation of the different models.
{"title":"A framework for the choice of the opportunistic maintenance policy in industrial contexts","authors":"M. Di Dio, R. Iannone, S. Miranda, S. Riemma","doi":"10.1109/IEEM.2013.6962703","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962703","url":null,"abstract":"Aim of the present paper is to propose a framework for the choice of the opportunistic maintenance models for applications in real contexts. The paper explores firstly the scientific literature on opportunistic maintenance in order to obtain a multi-criteria classification of the main existing models. This allowed us to devise a methodological map for the selection and the choice of the opportunistic maintenance models. This map requires an accurate data collection, performed by the user, in order to assess which of the opportunistic maintenance models is able to more effectively address the problems of a specific facility and/or organization. The paper proposes, for the first time in the literature, a tool aimed at guiding experts and professionals in the field of maintenance among the multiple scientific approaches to opportunistic maintenance in relation to the objectives to be achieved, the relevant restrictions and the available information, also taking into account the complexity of implementation of the different models.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"23 1","pages":"1716-1720"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88228788","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.6962421
H. Eriksson
The purpose of this paper is to understand quality management by describing differences between organisations and practices. This study looks at the scores for different criteria from the different quality award applicants in Sweden between 1992 and 2010. It is noteworthy to mention that the service industry outperforms the manufacturing industry. Furthermore, and maybe not surprisingly, large organisations are ahead of small and medium enterprises in the race for quality progress. In general, when comparing public with private organisations, private organisations do better, and especially process issues seem to be easier for private firms. This study also suggests that process management as it is described and taught needs to be revised to better fit the organisations. The time has come to question old truths about quality management, especially regarding who is better than whom at what, and who needs to learn what from whom.
{"title":"Who needs to learn what from whom? Understanding quality management by differentiating organisations and practices","authors":"H. Eriksson","doi":"10.1109/IEEM.2013.6962421","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962421","url":null,"abstract":"The purpose of this paper is to understand quality management by describing differences between organisations and practices. This study looks at the scores for different criteria from the different quality award applicants in Sweden between 1992 and 2010. It is noteworthy to mention that the service industry outperforms the manufacturing industry. Furthermore, and maybe not surprisingly, large organisations are ahead of small and medium enterprises in the race for quality progress. In general, when comparing public with private organisations, private organisations do better, and especially process issues seem to be easier for private firms. This study also suggests that process management as it is described and taught needs to be revised to better fit the organisations. The time has come to question old truths about quality management, especially regarding who is better than whom at what, and who needs to learn what from whom.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"140 1","pages":"295-299"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86626187","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.6962442
Erfan Mehmanchi, S. Shadrokh
In this paper, we propose a new mathematical programming model to tackle the multi-skilled project scheduling problem. Considering the effect of learning and forgetting on the human skills, an exponential learning function has been developed by assuming the efficiency of employees performing activities to be dynamic. Taking the nonlinearity of the function into account, we use separable programming to acquire an appropriate linear approximation for it. Moreover, the proposed model allows us to relax some of the binary variables linearly without any modifications. At the end, the final model is tested with some instances and is solved by CPLEX in order to confirm the implemented simplifications and linear approximation. After examination of the results and checking the constraints, the validity of the model and its modifications have been approved. Regarding NP-hardness of the MSPSP, this process can be a prominent step for developing meta-heuristic algorithms to solve real world problems.
{"title":"Solving a new mixed integer non-linear programming model of the multi-skilled project scheduling problem considering learning and forgetting effect on the employee efficiency","authors":"Erfan Mehmanchi, S. Shadrokh","doi":"10.1109/IEEM.2013.6962442","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962442","url":null,"abstract":"In this paper, we propose a new mathematical programming model to tackle the multi-skilled project scheduling problem. Considering the effect of learning and forgetting on the human skills, an exponential learning function has been developed by assuming the efficiency of employees performing activities to be dynamic. Taking the nonlinearity of the function into account, we use separable programming to acquire an appropriate linear approximation for it. Moreover, the proposed model allows us to relax some of the binary variables linearly without any modifications. At the end, the final model is tested with some instances and is solved by CPLEX in order to confirm the implemented simplifications and linear approximation. After examination of the results and checking the constraints, the validity of the model and its modifications have been approved. Regarding NP-hardness of the MSPSP, this process can be a prominent step for developing meta-heuristic algorithms to solve real world problems.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"83 1","pages":"400-404"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86904262","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.6962381
Gonen, T. Avrahami, U. Israeli
The set covering problem is well known as an NP-complete problem. A common heuristic family of algorithms that solves the problem is the Greedy type algorithm. In this study, we have to cover N sites by allocating a minimum number of servers. Each server covers a predefined pattern and, by locating it to a site K, it covers its neighbours according to its pattern. The Improved Heuristic Algorithm (IHA) presented here looks, at each iteration, for the most "problematic" site to be covered and selects the best server that covers it. The study compares the IHA with the Greedy algorithm. The results show that in most cases, for symmetric severs, the IHA finds a better solution (more than 10,000 problems were tested). For big problems of above 600 sites, the probability of finding a better solution is over 80%. However, the computing time of the IHA is much higher than that of the Greedy algorithm. Analyzing some cases where the Greedy algorithm found better solutions than the IHA brought us to the conclusion that the weakness of the IHA resides in the selection part of the minimal server's location. However, we have not yet determined the best solution for these cases.
{"title":"An Improved Heuristic Algorithm for the special case of the set covering problem","authors":"Gonen, T. Avrahami, U. Israeli","doi":"10.1109/IEEM.2013.6962381","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962381","url":null,"abstract":"The set covering problem is well known as an NP-complete problem. A common heuristic family of algorithms that solves the problem is the Greedy type algorithm. In this study, we have to cover N sites by allocating a minimum number of servers. Each server covers a predefined pattern and, by locating it to a site K, it covers its neighbours according to its pattern. The Improved Heuristic Algorithm (IHA) presented here looks, at each iteration, for the most \"problematic\" site to be covered and selects the best server that covers it. The study compares the IHA with the Greedy algorithm. The results show that in most cases, for symmetric severs, the IHA finds a better solution (more than 10,000 problems were tested). For big problems of above 600 sites, the probability of finding a better solution is over 80%. However, the computing time of the IHA is much higher than that of the Greedy algorithm. Analyzing some cases where the Greedy algorithm found better solutions than the IHA brought us to the conclusion that the weakness of the IHA resides in the selection part of the minimal server's location. However, we have not yet determined the best solution for these cases.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"122 1","pages":"93-97"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87697338","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.6962635
Aneesh Zutshi, A. Grilo, R. Jardim-Gonçalves
This paper introduces a Dynamic Agent Based Modelling Framework (DYNAMOD) that is designed for developing Digital Business Simulations. The model is based on literature review of three complementary research areas: Business Models, Business Applications of Agent Based Modeling and Digital Business Characteristics. This Framework is customisable and computationally implements key digital business characteristics including network effects, online and offline word of mouth, pricing strategies, amongst other features of the Digital Business Environment. DYNAMOD can be a generic framework for developing a variety of forcasting and simulation models that can provide a new computational approach to Digital Business Modeling and Analysis.
{"title":"DYNAMOD: A Modelling Framework for Digital Businesses based on Agent Based Modeling","authors":"Aneesh Zutshi, A. Grilo, R. Jardim-Gonçalves","doi":"10.1109/IEEM.2013.6962635","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962635","url":null,"abstract":"This paper introduces a Dynamic Agent Based Modelling Framework (DYNAMOD) that is designed for developing Digital Business Simulations. The model is based on literature review of three complementary research areas: Business Models, Business Applications of Agent Based Modeling and Digital Business Characteristics. This Framework is customisable and computationally implements key digital business characteristics including network effects, online and offline word of mouth, pricing strategies, amongst other features of the Digital Business Environment. DYNAMOD can be a generic framework for developing a variety of forcasting and simulation models that can provide a new computational approach to Digital Business Modeling and Analysis.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"11 1","pages":"1372-1376"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81584165","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.6962627
Hyunmin Jeon, Suk-yon Kang, Jae-Hoon Kim
Find the location based by IMU(Inertia Motion Sensor Unit) sensor in smartphone. DigitalCompass and Acceleration Double Integral, Zero Crossing used, Gyro and an algorithm that combines Digitalcompass thought. Finally, Gyro, Digita Compass, Gyro + Digitalcompass App was developed in three ways, new Algorithmic Frame.
{"title":"An Algorithmic Frame of hybrid position estimation for a mobile handset","authors":"Hyunmin Jeon, Suk-yon Kang, Jae-Hoon Kim","doi":"10.1109/IEEM.2013.6962627","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962627","url":null,"abstract":"Find the location based by IMU(Inertia Motion Sensor Unit) sensor in smartphone. DigitalCompass and Acceleration Double Integral, Zero Crossing used, Gyro and an algorithm that combines Digitalcompass thought. Finally, Gyro, Digita Compass, Gyro + Digitalcompass App was developed in three ways, new Algorithmic Frame.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"20 1","pages":"1334-1338"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84146221","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.6962551
L. Ponnambalam, L. Wenbin, Xiuju FU, X. Yin, Z. Wang, R. Goh
Increase in the frequency of disruptions in the recent times and their impact have increased the attention in supply chain disruption management research. The objective of this paper is to understand as to how a disruption might affect the supply chain network - depending upon the network structure, the node that is disrupted, the disruption in production capacity of the disrupted node and the period of the disruption - via decision trees. To this end, we first developed a 5-tier agent-based supply chain model and then simulated it for various what-if disruptive scenarios for 3 different network structures (80 trials for each network). Decision trees were then developed to model the impact due to varying degrees of disruption, and the recovery time from these disruptions. Visual outputs of the developed decision trees are presented to better interpret the rules. Supply chain managers can use the approach presented in this work to generate rules that can aid their mitigation planning during future disruptions.
{"title":"Decision trees to model the impact of disruption and recovery in supply chain networks","authors":"L. Ponnambalam, L. Wenbin, Xiuju FU, X. Yin, Z. Wang, R. Goh","doi":"10.1109/IEEM.2013.6962551","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962551","url":null,"abstract":"Increase in the frequency of disruptions in the recent times and their impact have increased the attention in supply chain disruption management research. The objective of this paper is to understand as to how a disruption might affect the supply chain network - depending upon the network structure, the node that is disrupted, the disruption in production capacity of the disrupted node and the period of the disruption - via decision trees. To this end, we first developed a 5-tier agent-based supply chain model and then simulated it for various what-if disruptive scenarios for 3 different network structures (80 trials for each network). Decision trees were then developed to model the impact due to varying degrees of disruption, and the recovery time from these disruptions. Visual outputs of the developed decision trees are presented to better interpret the rules. Supply chain managers can use the approach presented in this work to generate rules that can aid their mitigation planning during future disruptions.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"63 1","pages":"948-952"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84353049","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.6962484
Y. Watanabe, T. Nishi
Cluster tools are widely used for semiconductor manufacturing. Scheduling of multi-cluster tools has been received much attention. A cluster tool consists of several processing modules, transfer module with single or dual-armed handling robot and loadlock modules. The multi-cluster tool consists of two or three cluster tools which are connected with buffer module. In this paper, we present a deadlock-free scheduling for dual-armed multi-cluster tools with multi-flow. We develop a deadlock avoidance policy for dual-armed multi-cluster tools with dual path. A Petri net model is analyzed to derive a deadlock avoidance policy. The deadlock-freeness is confirmed by analyzing siphon of Petri net model. The deadlock-free scheduling method is proposed. The proposed method is applied to the scheduling problem of three-cluster tools with dual path. The computational results show that no deadlock occurs with the proposed deadlock avoidance policy.
{"title":"Deadlock avoidance policy for dual-armed multi-cluster tools with multi-flow","authors":"Y. Watanabe, T. Nishi","doi":"10.1109/IEEM.2013.6962484","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962484","url":null,"abstract":"Cluster tools are widely used for semiconductor manufacturing. Scheduling of multi-cluster tools has been received much attention. A cluster tool consists of several processing modules, transfer module with single or dual-armed handling robot and loadlock modules. The multi-cluster tool consists of two or three cluster tools which are connected with buffer module. In this paper, we present a deadlock-free scheduling for dual-armed multi-cluster tools with multi-flow. We develop a deadlock avoidance policy for dual-armed multi-cluster tools with dual path. A Petri net model is analyzed to derive a deadlock avoidance policy. The deadlock-freeness is confirmed by analyzing siphon of Petri net model. The deadlock-free scheduling method is proposed. The proposed method is applied to the scheduling problem of three-cluster tools with dual path. The computational results show that no deadlock occurs with the proposed deadlock avoidance policy.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"50 1","pages":"611-615"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83597340","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.6962483
F. Elezi, M. Schmidt, I. Tommelein, U. Lindemann
The Viable System Model (VSM) is a functional model of organizational structures whose implementation results in a presumably viable system. Despite scientific arguments and successful implementations in organizations, the VSM is still not widely used in practice. A reason may be that the VSM as defined by Beer addresses only the structural domain of the control (management) system in an organization and appears to miss some prerequisites for viability. Aiming for a more comprehensive approach for implementation of the VSM in practice, this paper proposes six enhanced requirements (prerequisites for viability) that organizations should try to fulfill in addition to the structural requirements. These six are deduced by analogies to “natural” viable systems, esp. the human body.
{"title":"Enhanced viability in organizations: An approach to expanding the requirements of the viable system model","authors":"F. Elezi, M. Schmidt, I. Tommelein, U. Lindemann","doi":"10.1109/IEEM.2013.6962483","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962483","url":null,"abstract":"The Viable System Model (VSM) is a functional model of organizational structures whose implementation results in a presumably viable system. Despite scientific arguments and successful implementations in organizations, the VSM is still not widely used in practice. A reason may be that the VSM as defined by Beer addresses only the structural domain of the control (management) system in an organization and appears to miss some prerequisites for viability. Aiming for a more comprehensive approach for implementation of the VSM in practice, this paper proposes six enhanced requirements (prerequisites for viability) that organizations should try to fulfill in addition to the structural requirements. These six are deduced by analogies to “natural” viable systems, esp. the human body.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"9 1","pages":"605-610"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89277321","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.6962405
J. Backstrand, J. Wikner
Customization and customer-driven manufacturing are both explicitly based on end-customer relations and customer requirements. The impact of these aspects on internal operations is relatively well known and can be investigated using time phasing and decoupling points. These tools are however rarely used for analyzing purchased material. Based on the time phased product structure, items are categorized according to three criteria: driver, uniqueness, and make/buy. Purchased items can thus be identified using the last criteria and then driver and uniqueness are used as a point of departure for categorizing purchased material. The approach hence provides a platform for development of supplier relations based on the customer requirements which is the core theme of the method for customer-driven purchasing.
{"title":"Time-phasing and decoupling points as analytical tools for purchasing","authors":"J. Backstrand, J. Wikner","doi":"10.1109/IEEM.2013.6962405","DOIUrl":"https://doi.org/10.1109/IEEM.2013.6962405","url":null,"abstract":"Customization and customer-driven manufacturing are both explicitly based on end-customer relations and customer requirements. The impact of these aspects on internal operations is relatively well known and can be investigated using time phasing and decoupling points. These tools are however rarely used for analyzing purchased material. Based on the time phased product structure, items are categorized according to three criteria: driver, uniqueness, and make/buy. Purchased items can thus be identified using the last criteria and then driver and uniqueness are used as a point of departure for categorizing purchased material. The approach hence provides a platform for development of supplier relations based on the customer requirements which is the core theme of the method for customer-driven purchasing.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"371 8","pages":"211-215"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91470051","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
扫码关注我们
求助内容：
应助结果提醒方式：