{"title":"在最大中断限制下最小化完工时间的在线重新调度","authors":"Yundong Mu, Xiao Guo","doi":"10.1109/ICMECG.2009.26","DOIUrl":null,"url":null,"abstract":"In the on-line rescheduling on a single machine, aset of original jobs has already been scheduled to minimizesome cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs intothe existing schedule without excessively disrupting it. Inthis paper, we consider the on-line rescheduling problem tominimize makespan under a limit on the maximum disruptionconstraints and give an on-line algorithm of competitive ratio3/2.","PeriodicalId":252323,"journal":{"name":"2009 International Conference on Management of e-Commerce and e-Government","volume":"428 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Disruptions\",\"authors\":\"Yundong Mu, Xiao Guo\",\"doi\":\"10.1109/ICMECG.2009.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the on-line rescheduling on a single machine, aset of original jobs has already been scheduled to minimizesome cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs intothe existing schedule without excessively disrupting it. Inthis paper, we consider the on-line rescheduling problem tominimize makespan under a limit on the maximum disruptionconstraints and give an on-line algorithm of competitive ratio3/2.\",\"PeriodicalId\":252323,\"journal\":{\"name\":\"2009 International Conference on Management of e-Commerce and e-Government\",\"volume\":\"428 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Management of e-Commerce and e-Government\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMECG.2009.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Management of e-Commerce and e-Government","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMECG.2009.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Disruptions
In the on-line rescheduling on a single machine, aset of original jobs has already been scheduled to minimizesome cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs intothe existing schedule without excessively disrupting it. Inthis paper, we consider the on-line rescheduling problem tominimize makespan under a limit on the maximum disruptionconstraints and give an on-line algorithm of competitive ratio3/2.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
