{"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}
引用次数: 1
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
