{"title":"A Bottleneck-Assignment Based Branch-and-Bound Algorithm to Minimize the Makespan in an m-Machine Permutation Flowshop","authors":"N. Madhushini, C. Rajendran","doi":"10.1007/S13727-012-0011-0","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":303783,"journal":{"name":"Technology Operation Management","volume":"181 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Technology Operation Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/S13727-012-0011-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
