de Farias Jr., I.R., Zhao, H. and Zhao, M. (2010) A Family of Inequalities Valid for the Robust Single Machine Scheduling Polyhedron. Computers & Operations Research, 37, 1610-1614.
http://dx.doi.org/10.1016/j.cor.2009.12.001

has been cited by the following article:

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

  AUTHORS: Fei Yang, Shengyuan Chen

  KEYWORDS: Single Machine Scheduling, Cut Generation, Robust Optimization

  JOURNAL NAME: American Journal of Operations Research, Vol.5 No.2, March 4, 2015

  ABSTRACT: 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.