{"title":"A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing","authors":"Jing Xiao, Li Zheng","doi":"10.1109/COASE.2010.5584514","DOIUrl":null,"url":null,"abstract":"In semiconductor assembly and test manufacturing, it is critical to optimize the scheduling of constraint stations to improve the system performance. This paper presents a continuous-time mixed-integer linear programming (MILP) model for the short-term batch scheduling with sequence-dependent setups in semiconductor assembly and test manufacturing to minimize the total completion time of the products. We formulate the problem of scheduling the two constraint stations and develop the MILP-based heuristic scheduling framework. The heuristic algorithm pre-determines the batch size according to the practical business rules and allocates the least flexible machines to the qualified high volume products. The system implementation at a semiconductor ATM factory demonstrates a significant reduction in total completion time compared to the traditional scheduling approach.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"20 1","pages":"87-92"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Case manager","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2010.5584514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In semiconductor assembly and test manufacturing, it is critical to optimize the scheduling of constraint stations to improve the system performance. This paper presents a continuous-time mixed-integer linear programming (MILP) model for the short-term batch scheduling with sequence-dependent setups in semiconductor assembly and test manufacturing to minimize the total completion time of the products. We formulate the problem of scheduling the two constraint stations and develop the MILP-based heuristic scheduling framework. The heuristic algorithm pre-determines the batch size according to the practical business rules and allocates the least flexible machines to the qualified high volume products. The system implementation at a semiconductor ATM factory demonstrates a significant reduction in total completion time compared to the traditional scheduling approach.