具有两个机器的路线流动车间问题的一个改进运行时间的精确解

{"title":"具有两个机器的路线流动车间问题的一个改进运行时间的精确解","authors":"I. Chernykh, A. Kononov, S. Sevastyanov","doi":"10.1007/s10951-023-00784-8","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An exact solution with an improved running time for the routing flow shop problem with two machines\",\"authors\":\"I. Chernykh, A. Kononov, S. Sevastyanov\",\"doi\":\"10.1007/s10951-023-00784-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":50061,\"journal\":{\"name\":\"Journal of Scheduling\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2023-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Scheduling\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1007/s10951-023-00784-8\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-023-00784-8","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}