Article citationsMore>>

Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of np-Completeness. Freeman.

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.