期刊文献+

Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems 被引量:8

Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems
在线阅读 下载PDF
导出
摘要 A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis. A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第2期208-215,共8页 系统工程与电子技术(英文版)
基金 supported by the National Natural Science Foundation of China (70601035 70801062)
关键词 non-identical parallel machine scheduling problem with multiple time windows (NPMSPMTW) oversubscribed self- adaptive large neighborhood search (SALNS) machine learning. non-identical parallel machine scheduling problem with multiple time windows (NPMSPMTW), oversubscribed, self- adaptive large neighborhood search (SALNS), machine learning.
  • 相关文献

二级参考文献1

同被引文献58

引证文献8

二级引证文献55

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部