Article citationsMore>>

Hall, L., Shmoys, B., Wein, J. and Schulz, A. (1997) Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Mathematics of Operation Research, 22, 513-544.
http://dx.doi.org/10.1287/moor.22.3.513

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.