Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem

• 作者: Fei Yang Shengyuan Chen
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 工学
• 关键词: Single Machine SCHEDULING CUT Generation Robust Optimization
• 年，卷（期）: 2015,（2）
• 页码范围: 69-76
• 页数: 8页
• 分类号: TP1

摘要

We study the classical single machine scheduling problem but with uncertainty. A robust optimization model is presented, and an effective deep cut is derived. Numerical experiments show effectiveness of the derived cut.