{"title":"Stacker-reclaimer scheduling for raw material yard operation","authors":"Dayong Hu, Z. Yao","doi":"10.1109/IWACI.2010.5585235","DOIUrl":null,"url":null,"abstract":"Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.","PeriodicalId":196572,"journal":{"name":"International Workshop on Advanced Computational Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Advanced Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWACI.2010.5585235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.