Pub Date : 2011-12-01DOI: 10.1080/10170669.2011.648214
Suh-Jenq Yang, Dar-Li Yang, Teng-Ruey Chang
The goal of group technology in manufacturing process is to identify a set of products with similar processing requirements and minimize machine changeover and setup. Although different models of joint deterioration and learning effects have been extensively studied in various areas, it has rarely been studied in the context of group scheduling. In this article, we consider single-machine scheduling problems involving deterioration and learning effects simultaneously under the group technology and the group availability assumptions. We assume that the group setup time is a function of position-dependent learning while the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. We further assume that after the setup, the machine deterioration will reset first and then starts anew. We prove that the makespan and the total completion time minimization problems can be optimally solved in polynomial time algorithms with agreeable conditions.
{"title":"Single-machine scheduling with joint deterioration and learning effects under group technology and group availability assumptions","authors":"Suh-Jenq Yang, Dar-Li Yang, Teng-Ruey Chang","doi":"10.1080/10170669.2011.648214","DOIUrl":"https://doi.org/10.1080/10170669.2011.648214","url":null,"abstract":"The goal of group technology in manufacturing process is to identify a set of products with similar processing requirements and minimize machine changeover and setup. Although different models of joint deterioration and learning effects have been extensively studied in various areas, it has rarely been studied in the context of group scheduling. In this article, we consider single-machine scheduling problems involving deterioration and learning effects simultaneously under the group technology and the group availability assumptions. We assume that the group setup time is a function of position-dependent learning while the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. We further assume that after the setup, the machine deterioration will reset first and then starts anew. We prove that the makespan and the total completion time minimization problems can be optimally solved in polynomial time algorithms with agreeable conditions.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130921570","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 : 2011-12-01DOI: 10.1080/10170669.2011.646324
D. Chao, Jiun-Ting Chen
Unlike other techniques, Li and Zhou add control nodes and arcs for only elementary siphons greatly reducing the number of control nodes and arcs (implemented by costly hardware of I/O devices and memory) required for deadlock control in Petri net supervisors. Li and Zhou propose that the number of elementary siphons is linear to the size of the net. An elementary siphon can be synthesized from a resource circuit consisting of a set of connected segments. We show that the total number of elementary siphons, |ПE|, is upper bounded by the total number of resource places |PR | lower than that min(|P|, |T|) by Li and Zhou where |P| (|T|) is the number of places (transitions) in the net. Also, we claim that the number of elementary siphons |ПE| equals that of independent segments (simple paths) in the resource subnet of an S3PR (systems of simple sequential processes with resources). Resource circuits for the elementary siphons can be traced out based on a graph-traversal algorithm. During the traversal process, we can also identify independent segments (i.e. their characteristic T-vectors are independent) along with those segments for elementary siphons. This offers us an alternative and yet deeper understanding of the computation of elementary siphons. Also, it allows us to adapt the algorithm to compute elementary siphons in [2] for a subclass of S3PR (called S4PR) to more complicated S3PR that contains weakly dependent siphons.
{"title":"Segment theory to compute elementary siphons in Petri nets for deadlock control","authors":"D. Chao, Jiun-Ting Chen","doi":"10.1080/10170669.2011.646324","DOIUrl":"https://doi.org/10.1080/10170669.2011.646324","url":null,"abstract":"Unlike other techniques, Li and Zhou add control nodes and arcs for only elementary siphons greatly reducing the number of control nodes and arcs (implemented by costly hardware of I/O devices and memory) required for deadlock control in Petri net supervisors. Li and Zhou propose that the number of elementary siphons is linear to the size of the net. An elementary siphon can be synthesized from a resource circuit consisting of a set of connected segments. We show that the total number of elementary siphons, |ПE|, is upper bounded by the total number of resource places |PR | lower than that min(|P|, |T|) by Li and Zhou where |P| (|T|) is the number of places (transitions) in the net. Also, we claim that the number of elementary siphons |ПE| equals that of independent segments (simple paths) in the resource subnet of an S3PR (systems of simple sequential processes with resources). Resource circuits for the elementary siphons can be traced out based on a graph-traversal algorithm. During the traversal process, we can also identify independent segments (i.e. their characteristic T-vectors are independent) along with those segments for elementary siphons. This offers us an alternative and yet deeper understanding of the computation of elementary siphons. Also, it allows us to adapt the algorithm to compute elementary siphons in [2] for a subclass of S3PR (called S4PR) to more complicated S3PR that contains weakly dependent siphons.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128067050","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 : 2011-12-01DOI: 10.1080/10170669.2011.644330
Ting-Yu Chen
Considering the decision-maker's point of view and circumstances in the multiple criteria decision-making process, subjective judgments of criterion importance are inherently imprecise and involve many uncertainties. Interval type-2 fuzzy sets are associated with greater imprecision and more ambiguities than type-1 fuzzy sets. In the context of interval type-2 trapezoidal fuzzy numbers, this article presents an integrated approach to combine the objective and subjective importances of decision criteria. In addition, the concept of signed distances has been extended to develop a new method for acquiring objective importance values of criteria with interval type-2 fuzzy data. Finally, the feasibility of the proposed methods is illustrated by a practical example of landfill site selection.
{"title":"An integrated approach for assessing criterion importance with interval type-2 fuzzy sets and signed distances","authors":"Ting-Yu Chen","doi":"10.1080/10170669.2011.644330","DOIUrl":"https://doi.org/10.1080/10170669.2011.644330","url":null,"abstract":"Considering the decision-maker's point of view and circumstances in the multiple criteria decision-making process, subjective judgments of criterion importance are inherently imprecise and involve many uncertainties. Interval type-2 fuzzy sets are associated with greater imprecision and more ambiguities than type-1 fuzzy sets. In the context of interval type-2 trapezoidal fuzzy numbers, this article presents an integrated approach to combine the objective and subjective importances of decision criteria. In addition, the concept of signed distances has been extended to develop a new method for acquiring objective importance values of criteria with interval type-2 fuzzy data. Finally, the feasibility of the proposed methods is illustrated by a practical example of landfill site selection.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115895075","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 : 2011-10-01DOI: 10.1080/10170669.2011.636382
Yanting Li, Hao Wang
Although statistical process control (SPC) charts have been used for multistage manufacturing process quality monitoring for years, how to effectively allocate conventional SPC charts appropriately in a serial–parallel multistage processes has not been thoroughly studied. In this article, aiming to minimize the expected overall quality cost, we use the linear state-space model to model multistage processes and propose a strategy to properly allocate control charts in serial–parallel multistage manufacturing processes by considering the interrelationship information between stages and the simultaneous occurrences of multiple faults at different workstations. Based on the proposed chart allocation strategy, we are able to make rational chart allocation decisions to achieve quicker detection capability over the whole potential fault set. A hood assembly example is used to demonstrate the applications of the chart allocation strategy.
{"title":"Chart allocation strategy for serial–parallel multistage manufacturing processes with multiple faults","authors":"Yanting Li, Hao Wang","doi":"10.1080/10170669.2011.636382","DOIUrl":"https://doi.org/10.1080/10170669.2011.636382","url":null,"abstract":"Although statistical process control (SPC) charts have been used for multistage manufacturing process quality monitoring for years, how to effectively allocate conventional SPC charts appropriately in a serial–parallel multistage processes has not been thoroughly studied. In this article, aiming to minimize the expected overall quality cost, we use the linear state-space model to model multistage processes and propose a strategy to properly allocate control charts in serial–parallel multistage manufacturing processes by considering the interrelationship information between stages and the simultaneous occurrences of multiple faults at different workstations. Based on the proposed chart allocation strategy, we are able to make rational chart allocation decisions to achieve quicker detection capability over the whole potential fault set. A hood assembly example is used to demonstrate the applications of the chart allocation strategy.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132162672","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 : 2011-10-01DOI: 10.1080/10170669.2011.636383
Xianghui Ning, Chunjie Wu
In a manufacturing process, deterioration in quality may be represented by changes in process variables’ distributions rather than shifts in their means or variances. In this case, when means or variances cannot reflect the real process conditions, we need to monitor whether a sample conforms to an in-control distribution. Quantile-based control charts are suitable tools which can do the monitoring. However, there are no specific procedures for the users to follow to construct such a chart. In this article, we propose a new criterion for the construction of the quantile-based control chart. With this criterion, appropriate quantiles are selected to maximize the test power of the charted statistic. We study most commonly used distributions and specify guidelines for the construction of the quantile-based control charts. Simulation results demonstrate the high efficiency of the proposed method.
{"title":"Improved design of quantile-based control charts","authors":"Xianghui Ning, Chunjie Wu","doi":"10.1080/10170669.2011.636383","DOIUrl":"https://doi.org/10.1080/10170669.2011.636383","url":null,"abstract":"In a manufacturing process, deterioration in quality may be represented by changes in process variables’ distributions rather than shifts in their means or variances. In this case, when means or variances cannot reflect the real process conditions, we need to monitor whether a sample conforms to an in-control distribution. Quantile-based control charts are suitable tools which can do the monitoring. However, there are no specific procedures for the users to follow to construct such a chart. In this article, we propose a new criterion for the construction of the quantile-based control chart. With this criterion, appropriate quantiles are selected to maximize the test power of the charted statistic. We study most commonly used distributions and specify guidelines for the construction of the quantile-based control charts. Simulation results demonstrate the high efficiency of the proposed method.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131635255","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 : 2011-10-01DOI: 10.1080/10170669.2011.637579
Cheng-Kang Lee, Y. Shen, Taho Yang, Aixing Tang
The trend of globalization has been driving the investment of multi-site production facilities to improve both service level and production costs. Uneven distribution or insufficient capacity may occur occasionally. Facing a multi-site production planning problem, a fishing-net manufacturing company owning three factories in different countries needs to negotiate with customers and plan the production schedule more accurately. Aiming at maximizing profit, a two-phase planning model is built. In the first phase, a heuristic is designed to screen out the orders that cannot be satisfied. The planner will then negotiate with customers to postpone the due date or to cancel these orders. The accepted orders are planned by the second phase that uses integer programming formulation to solve the multi-site production planning problem. The proposed methodology is compared with the existing method. Simulation is adopted for the empirical illustrations. The results are very promising for the proposed methodology for solving practical applications.
{"title":"An effective two-phase approach in solving a practical multi-site order scheduling problem","authors":"Cheng-Kang Lee, Y. Shen, Taho Yang, Aixing Tang","doi":"10.1080/10170669.2011.637579","DOIUrl":"https://doi.org/10.1080/10170669.2011.637579","url":null,"abstract":"The trend of globalization has been driving the investment of multi-site production facilities to improve both service level and production costs. Uneven distribution or insufficient capacity may occur occasionally. Facing a multi-site production planning problem, a fishing-net manufacturing company owning three factories in different countries needs to negotiate with customers and plan the production schedule more accurately. Aiming at maximizing profit, a two-phase planning model is built. In the first phase, a heuristic is designed to screen out the orders that cannot be satisfied. The planner will then negotiate with customers to postpone the due date or to cancel these orders. The accepted orders are planned by the second phase that uses integer programming formulation to solve the multi-site production planning problem. The proposed methodology is compared with the existing method. Simulation is adopted for the empirical illustrations. The results are very promising for the proposed methodology for solving practical applications.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129685689","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 : 2011-10-01DOI: 10.1080/10170669.2011.637241
M. Khandan, M. Maghsoudipour, S. Vosoughi
An effective safety management requires paying attention to human factors for accident prevention. The aim of this study was to evaluation and analysis of safety climate in order to select the best work shift group in an Iranian petrochemical company, in 2010. A cross-sectional study was designed in that safety climate questionnaire were distributed between 151 workers. We used ELECTRE method to find the best work shift group. The number of returned valid questionnaires was 134 out of 151 and response rate was 88.74%. Questionnaire's reliability assessed by Cronbach's alpha was 0.928. The results indicated that 68.7% of workers had positive safety climate. The results also notified a significant relationship between age and safety climate (p < 0.05). Using ELECTRE method, most effective shift group and the least attractive alternatives for intervention were selected in this company. This study showed the importance of attention to positive safety attitude promotion between employees.
{"title":"Ranking of working shift groups in an Iranian petrochemical company using ELECTRE method based on safety climate assessment results","authors":"M. Khandan, M. Maghsoudipour, S. Vosoughi","doi":"10.1080/10170669.2011.637241","DOIUrl":"https://doi.org/10.1080/10170669.2011.637241","url":null,"abstract":"An effective safety management requires paying attention to human factors for accident prevention. The aim of this study was to evaluation and analysis of safety climate in order to select the best work shift group in an Iranian petrochemical company, in 2010. A cross-sectional study was designed in that safety climate questionnaire were distributed between 151 workers. We used ELECTRE method to find the best work shift group. The number of returned valid questionnaires was 134 out of 151 and response rate was 88.74%. Questionnaire's reliability assessed by Cronbach's alpha was 0.928. The results indicated that 68.7% of workers had positive safety climate. The results also notified a significant relationship between age and safety climate (p < 0.05). Using ELECTRE method, most effective shift group and the least attractive alternatives for intervention were selected in this company. This study showed the importance of attention to positive safety attitude promotion between employees.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133657312","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 : 2011-10-01DOI: 10.1080/10170669.2011.636384
Yufang Chiu, Po-Chao Lin, He-Hsuan Hsu
Enterprises have difficulty in completing all the required operations when facing market competition and environmental changes. In such situations, enterprises begin to explore their capacity to outsource logistics from external support, hence giving the existence of a third-party logistics. But in recent years, few scholars have inducted the third-party logistics to reverse logistics. This study thus explores the relationships among recycling by manufacturers, retailers, and third-party logistics providers in the framework of reverse logistics. Returned items must be disassembled, inspected, and disposed off to determine if they can be re-manufactured in the recycling process. Thus, this study constructs a mathematical model to get the maximum profit under the assumption that transfer price is induced by a third-party logistics service. From an overall supply chain standpoint of total profit, the third model in which the third-party provider leads returned product collection before transferring back to the manufacturer for remanufacturing, is preferred. This study shows that it is feasible when a third-party logistics provider is used in the reverse logistics system and that return rate and retail price are the main determinants of total profit. Therefore, the total profit increases when the retail price increases.
{"title":"Considering third-party logistics providers in reverse logistics","authors":"Yufang Chiu, Po-Chao Lin, He-Hsuan Hsu","doi":"10.1080/10170669.2011.636384","DOIUrl":"https://doi.org/10.1080/10170669.2011.636384","url":null,"abstract":"Enterprises have difficulty in completing all the required operations when facing market competition and environmental changes. In such situations, enterprises begin to explore their capacity to outsource logistics from external support, hence giving the existence of a third-party logistics. But in recent years, few scholars have inducted the third-party logistics to reverse logistics. This study thus explores the relationships among recycling by manufacturers, retailers, and third-party logistics providers in the framework of reverse logistics. Returned items must be disassembled, inspected, and disposed off to determine if they can be re-manufactured in the recycling process. Thus, this study constructs a mathematical model to get the maximum profit under the assumption that transfer price is induced by a third-party logistics service. From an overall supply chain standpoint of total profit, the third model in which the third-party provider leads returned product collection before transferring back to the manufacturer for remanufacturing, is preferred. This study shows that it is feasible when a third-party logistics provider is used in the reverse logistics system and that return rate and retail price are the main determinants of total profit. Therefore, the total profit increases when the retail price increases.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131418575","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 : 2011-10-01DOI: 10.1080/10170669.2011.636842
Feng-Cheng Yang, Yachao Wang
This article introduces a resource allocation embedded assembly line balancing problem (RAELBP), whose solution construction involves operations of operator selection/assignment and task sequencing/grouping. The mathematical model of the RAELBP is rigorously defined. In addition, an ant colony optimization (ACO) method, resource allocation first ACO method, is developed for the problem. An artificial ant selects and assigns an operator to each workstation first and then sequentially assigns assembly tasks to each workstation subject to precedence constraints. Alternatives and options relating to the objective function and heuristic value evaluations are provided. A data generator is developed to generate benchmarks for the problem. A software application, RAELBP Solver, implementing the proposed methods is developed for numerical tests. Numerical tests are conducted for different computation modes on three benchmarks of various sizes. Results indicate that the proposed method is capable of solving the problem and achievements in obtaining non-dominated solutions are varied in different modes.
{"title":"Resource allocation embedded line balancing problem and ant colony optimization method","authors":"Feng-Cheng Yang, Yachao Wang","doi":"10.1080/10170669.2011.636842","DOIUrl":"https://doi.org/10.1080/10170669.2011.636842","url":null,"abstract":"This article introduces a resource allocation embedded assembly line balancing problem (RAELBP), whose solution construction involves operations of operator selection/assignment and task sequencing/grouping. The mathematical model of the RAELBP is rigorously defined. In addition, an ant colony optimization (ACO) method, resource allocation first ACO method, is developed for the problem. An artificial ant selects and assigns an operator to each workstation first and then sequentially assigns assembly tasks to each workstation subject to precedence constraints. Alternatives and options relating to the objective function and heuristic value evaluations are provided. A data generator is developed to generate benchmarks for the problem. A software application, RAELBP Solver, implementing the proposed methods is developed for numerical tests. Numerical tests are conducted for different computation modes on three benchmarks of various sizes. Results indicate that the proposed method is capable of solving the problem and achievements in obtaining non-dominated solutions are varied in different modes.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133597601","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 : 2011-09-01DOI: 10.1080/10170669.2011.599433
Shan-Huen Huang, Ta-Hui Yang, Rong-Tsu Wang
This study addresses the crew-scheduling problems for railway drivers’ duty trips on a railway timetable represented as a time–space diagram. Based on the diagram, the railway driver-scheduling problem is then transformed into an arc routing problem (ARP). Because of the special properties and features of the problem, the ARP can be treated as a typical vehicle node routing problem. The Ant Colony Optimization algorithm is employed to solve the transformed problem. Real data from the Taiwan Railways Administration are used to test the proposed models and algorithm. The results showed that the dead-heading-allowed approach is able to obtain a better solution in terms of fewer drivers and shorter idle time.
{"title":"Ant colony optimization for railway driver crew scheduling: from modeling to implementation","authors":"Shan-Huen Huang, Ta-Hui Yang, Rong-Tsu Wang","doi":"10.1080/10170669.2011.599433","DOIUrl":"https://doi.org/10.1080/10170669.2011.599433","url":null,"abstract":"This study addresses the crew-scheduling problems for railway drivers’ duty trips on a railway timetable represented as a time–space diagram. Based on the diagram, the railway driver-scheduling problem is then transformed into an arc routing problem (ARP). Because of the special properties and features of the problem, the ARP can be treated as a typical vehicle node routing problem. The Ant Colony Optimization algorithm is employed to solve the transformed problem. Real data from the Taiwan Railways Administration are used to test the proposed models and algorithm. The results showed that the dead-heading-allowed approach is able to obtain a better solution in terms of fewer drivers and shorter idle time.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"10 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126194028","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
扫码关注我们
求助内容：
应助结果提醒方式：