安排截止日期和截止日期

Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on Pub Date : 1900-01-01 DOI:10.1109/ISIE.2002.1026069

V. Gordon, G. Finke, J. Proth

{"title":"安排截止日期和截止日期","authors":"V. Gordon, G. Finke, J. Proth","doi":"10.1109/ISIE.2002.1026069","DOIUrl":null,"url":null,"abstract":"Scheduling problems involving due dates or deadlines are analyzed. Emphasis is placed on the complexity of the problems (polynomially solvable or NP-hard) and on the time complexity of algorithms for polynomially solvable problems or on the kind of algorithms proposed (enumerative, local search, etc.) for other problems.","PeriodicalId":330283,"journal":{"name":"Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Scheduling with due dates and deadlines\",\"authors\":\"V. Gordon, G. Finke, J. Proth\",\"doi\":\"10.1109/ISIE.2002.1026069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling problems involving due dates or deadlines are analyzed. Emphasis is placed on the complexity of the problems (polynomially solvable or NP-hard) and on the time complexity of algorithms for polynomially solvable problems or on the kind of algorithms proposed (enumerative, local search, etc.) for other problems.\",\"PeriodicalId\":330283,\"journal\":{\"name\":\"Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIE.2002.1026069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIE.2002.1026069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

对涉及到期日或截止日期的调度问题进行分析。重点放在问题的复杂性(多项式可解或NP-hard)和多项式可解问题的算法的时间复杂性或针对其他问题提出的算法类型(枚举，局部搜索等)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Scheduling with due dates and deadlines

Scheduling problems involving due dates or deadlines are analyzed. Emphasis is placed on the complexity of the problems (polynomially solvable or NP-hard) and on the time complexity of algorithms for polynomially solvable problems or on the kind of algorithms proposed (enumerative, local search, etc.) for other problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on

自引率

0.00%

发文量