在允许非强制空闲时间的情况下，排列流车间中作业调度的启发式方法以最小化总早迟到

{"title":"在允许非强制空闲时间的情况下，排列流车间中作业调度的启发式方法以最小化总早迟到","authors":"J. Schaller, Jorge M. S. Valente","doi":"10.1016/j.eswa.2018.11.007","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":12115,"journal":{"name":"Expert Syst. Appl.","volume":"1 1","pages":"376-386"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed\",\"authors\":\"J. Schaller, Jorge M. S. Valente\",\"doi\":\"10.1016/j.eswa.2018.11.007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":12115,\"journal\":{\"name\":\"Expert Syst. Appl.\",\"volume\":\"1 1\",\"pages\":\"376-386\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Expert Syst. Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.eswa.2018.11.007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Syst. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.eswa.2018.11.007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}