具有抢占的单机问题最优解的组合结构

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) Pub Date : 2019-08-01 DOI:10.1109/OPCS.2019.8880148

K. A. Chernykh, V. Servakh

{"title":"具有抢占的单机问题最优解的组合结构","authors":"K. A. Chernykh, V. Servakh","doi":"10.1109/OPCS.2019.8880148","DOIUrl":null,"url":null,"abstract":"The problem of minimizing the weighted average time to complete jobs on a single machine is considered. The release dates of jobs are fixed. The preemptions are possible. The processing times of all jobs are equal. The computational complexity this problem is unknown. An approach to the analysis of the structure of the optimal solutions is proposed. Polynomial algorithms are described for some important classes.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combinatorial Structure of Optimal Solutions to the Problem of a Single Machine with Preemption\",\"authors\":\"K. A. Chernykh, V. Servakh\",\"doi\":\"10.1109/OPCS.2019.8880148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of minimizing the weighted average time to complete jobs on a single machine is considered. The release dates of jobs are fixed. The preemptions are possible. The processing times of all jobs are equal. The computational complexity this problem is unknown. An approach to the analysis of the structure of the optimal solutions is proposed. Polynomial algorithms are described for some important classes.\",\"PeriodicalId\":288547,\"journal\":{\"name\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPCS.2019.8880148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

考虑了在单台机器上完成作业的加权平均时间最小化问题。作业的发布日期是固定的。先发制人是可能的。所有作业的处理时间相等。这个问题的计算复杂度是未知的。提出了一种分析最优解结构的方法。描述了一些重要类的多项式算法。

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

查看原文本刊更多论文

Combinatorial Structure of Optimal Solutions to the Problem of a Single Machine with Preemption

The problem of minimizing the weighted average time to complete jobs on a single machine is considered. The release dates of jobs are fixed. The preemptions are possible. The processing times of all jobs are equal. The computational complexity this problem is unknown. An approach to the analysis of the structure of the optimal solutions is proposed. Polynomial algorithms are described for some important classes.

求助全文

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

来源期刊

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)

自引率

0.00%

发文量