Author(s)

Fei Yang, Shengyuan Chen

Department of Mathematics and Statistics, York University, Toronto, Canada.

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.

Single Machine Scheduling, Cut Generation, Robust Optimization

Yang, F. and Chen, S. (2015) Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem. American Journal of Operations Research, 5, 69-76. doi: 10.4236/ajor.2015.52006.