Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems

• 作 者: Pei Wang Gerhard Reinelt Yueji
• 机 构: CollegeofInformationSystemsandManagement,DiscreteOptimizationResearchGroup
• 出 处: 系统工程与电子技术：英文版
• 发表日期: 2012年2期
• 关键词: 邻域搜索算法 调度问题 自适应 并行机 地球观测卫星 机器学习 敏感性分析 时间窗口 non-identical parallel machine schedu
• 基金项目: This work was supported by the National Natural Science Foundation of China （70601035, 70801062）.Acknowledgment Special thanks give to Philippe Laborie. Without the stim- ulating discussion with him,

A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with multiple time windows is presented.The problems' another feature lies in oversubscription,namely not all jobs can be scheduled within spec