一种具有学习效应的双机抢占式作业调度枚举算法

2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR) Pub Date : 2018-08-01 DOI:10.1109/MMAR.2018.8485820

Marcin Żurowski, Stanisław Gawiejnowicz

{"title":"一种具有学习效应的双机抢占式作业调度枚举算法","authors":"Marcin Żurowski, Stanisław Gawiejnowicz","doi":"10.1109/MMAR.2018.8485820","DOIUrl":null,"url":null,"abstract":"We consider a two-machine scheduling problem with a learning effect and the objective to minimize the schedule length. Jobs are preemptable but only preemption of a single job is allowed. We present basic properties of this problem and an enumerative algorithm for its exact solution.","PeriodicalId":201658,"journal":{"name":"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Enumerative Algorithm for a Two-Machine Preemptive Job Scheduling with a Learning Effect\",\"authors\":\"Marcin Żurowski, Stanisław Gawiejnowicz\",\"doi\":\"10.1109/MMAR.2018.8485820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a two-machine scheduling problem with a learning effect and the objective to minimize the schedule length. Jobs are preemptable but only preemption of a single job is allowed. We present basic properties of this problem and an enumerative algorithm for its exact solution.\",\"PeriodicalId\":201658,\"journal\":{\"name\":\"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMAR.2018.8485820\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2018.8485820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们考虑了一个具有学习效应的双机调度问题，目标是最小化调度长度。作业是可抢占的，但只允许对单个作业进行抢占。给出了该问题的基本性质和精确解的枚举算法。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An Enumerative Algorithm for a Two-Machine Preemptive Job Scheduling with a Learning Effect

We consider a two-machine scheduling problem with a learning effect and the objective to minimize the schedule length. Jobs are preemptable but only preemption of a single job is allowed. We present basic properties of this problem and an enumerative algorithm for its exact solution.

求助全文

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

来源期刊

2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)

自引率

0.00%

发文量