{"title":"双准则双机流水车间调度:近似算法及其限制","authors":"Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo","doi":"10.1007/s10951-023-00781-x","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"1 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits\",\"authors\":\"Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo\",\"doi\":\"10.1007/s10951-023-00781-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":50061,\"journal\":{\"name\":\"Journal of Scheduling\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2023-05-31\",\"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-00781-x\",\"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-00781-x","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
期刊介绍:
The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.