具有最小完工时间和作业副本的平顺流车间调度问题的精确启发式算法

{"title":"具有最小完工时间和作业副本的平顺流车间调度问题的精确启发式算法","authors":"J. Bautista","doi":"10.1007/s13748-021-00249-z","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":46027,"journal":{"name":"Progress in Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s13748-021-00249-z","citationCount":"0","resultStr":"{\"title\":\"Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas\",\"authors\":\"J. Bautista\",\"doi\":\"10.1007/s13748-021-00249-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":46027,\"journal\":{\"name\":\"Progress in Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s13748-021-00249-z\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Progress in Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s13748-021-00249-z\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Progress in Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s13748-021-00249-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}