An experimental study of LP-based approximation algorithms for scheduling problems

MWP Savelsbergh, RN Uma… - INFORMS Journal on …, 2005 - pubsonline.informs.org
Recently there has been much progress on the design of approximation algorithms for a
variety of scheduling problems in which the goal is to minimize the average weighted …

[PDF][PDF] An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

MWP Savelsbergh, RN Uma, J Wein - isye.gatech.edu
Recently there has been much progress on the design of approximation algorithms for a
variety of scheduling problems in which the goal is to minimize the average weighted …

[PDF][PDF] An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

MWP Savelsbergh, RN Uma… - INFORMS Journal on …, 2005 - scholar.archive.org
Finally, we extend the techniques to a rather different and more complex problem that arises
from an actual manufacturing application: resource-constrained project scheduling. In this …

[PDF][PDF] An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

MWP Savelsbergh, RN Uma, J Wein - researchgate.net
Recently there has been much progress on the design of approximation algorithms for a
variety of scheduling problems in which the goal is to minimize the average weighted …

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

MWP Savelsbergh, RN Uma… - INFORMS Journal on …, 2005 - search.proquest.com
Recently there has been much progress on the design of approximation algorithms for a
variety of scheduling problems in which the goal is to minimize the average weighted …

An experimental study of LP-based approximation algorithms for scheduling problems

MWP Savelsbergh, RN Uma, J Wein - … of the ninth annual ACM-SIAM …, 1998 - dl.acm.org
Abstract 1 Introduction Recently there has been much progress on the design of
approximation algorithms for a variety of scheduling problems in which the goal is to …

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems.

MWP Savelsbergh, RN Uma… - INFORMS Journal on …, 2005 - search.ebscohost.com
Recently there has been much progress on the design of approximation algorithms for a
variety of scheduling problems in which the goal is to minimize the average weighted …

An experimental study of LP-based approximation algorithms for scheduling problems.

MWP Savelsbergh, RN Uma, J Wein - INFORMS Journal on …, 2005 - go.gale.com
Recently there has been much progress on the design of approximation algorithms for a
variety of scheduling problems in which the goal is to minimize the average weighted …

[PDF][PDF] An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

MWP Savelsbergh, RN Uma, J Wein - INFORMS Journal on Computing, 2005 - Citeseer
Finally, we extend the techniques to a rather different and more complex problem that arises
from an actual manufacturing application: resource-constrained project scheduling. In this …

[PDF][PDF] An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

MWP Savelsbergh, RN Uma… - INFORMS Journal on …, 2005 - akturk.bilkent.edu.tr
Finally, we extend the techniques to a rather different and more complex problem that arises
from an actual manufacturing application: resource-constrained project scheduling. In this …