G.L. Nemhauser and M.W.P. Savelsbergh. A cutting plane algorithm for the single machine scheduling problem with release dates. In M. Akguk, H. Hamacher, and S. Tufecki, editors, Combinatorial Optimization: New Frontiers in the Theory and Practice, NATO ASI Series F: Computer and Systems Sciences 82, pages 63--84. Springer--Verlag, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polyhedral Approaches to Machine Scheduling - Queyranne, Schulz (1994) (16 citations) (Correct)
....know for each pair of jobs j; k which precedes the other. Hence, we obtain linear ordering variables ffi jk . These are one if j precedes k and zero, otherwise. Linear ordering variables have been used, among others, by Peters [74] Dyer and Wolsey [34] Wolsey [101] and Nemhauser and Savelsbergh [72]. Positional date variables and fl denoting the start time and completion time of the th job in the schedule, respectively, have been used together with assignment variables u j by Lasserre and Queyranne [59] In Section 5 we summarize their results from a different perspective and present ....
....X j2N w j C j = X j;k2N k 6=j w j p k ffi kj X j2N w j p j (4.5) as was already observed by Potts [76] Notice that the cost coefficients have a very special structure. For the sequencing problem itself, without any other restrictions, Peters [74] as well as Nemhauser and Savelsbergh [72] showed, using Smith s rule [95] and linear programming duality, that we may drop the integrality as well as the transitivity constraints (4.2) Then the optimal objective value of the linear program with objective function (4.5) and constraints (4.1) and (4.3) equals the value of a minimum weight ....
[Article contains additional citation context not shown here]
G. L. Nemhauser and M. W. P. Savelsbergh, A cutting plane algorithm for the single machine scheduling problem with release times, Combinatorial Optimization: New Frontiers in the Theory and Practice (M. Akgul, H. Hamacher, and S. Tufecki, eds.), NATO ASI Series F: Computer and System Sciences, vol. 82, Springer, Berlin, 1992, pp. 63--84. 59
How to Make OR-results Available: A Proposal for Project.. - Müller, Solte (1993) (Correct)
....of combinatorial optimization where linear programming is not adequate: to model a scheduling problem as MILP results in an excessive number of linear constraints. The polyhedral approach seems to be promising only for very special problem classes, as, for example, single machine scheduling [NS91, QW91] and job shop scheduling [AC91, B85] For general classes, like scheduling project networks with resource constraints and time windows [BMR88] pure combinatorial approaches are favored. Such approaches require deep mathematical insight. This may be the reason why commercial solvers for project ....
G.L. Nemhauser, M.W.P. Savelsbergh, "A Cutting Plane Algorithm for Single Machine Scheduling Problems with Release Times", Proceedings of the the first workshop on COST, Rutgers Univeristy, April 2-6, 1991, DIMACS Technical Report 91-18, 1991
A Polyhedral Approach to Single-Machine Scheduling.. - van den Akker, van.. (1997) (1 citation) Self-citation (Savelsbergh) (Correct)
No context found.
G.L. Nemhauser, M.W.P. Savelsbergh (1992). A cutting plane algorithm for the single machine scheduling problem with release times. M. Akg ul, H. Hamacher, S. Tufecki (eds.). Combinatorial Optimization: New Frontiers in the Theory and Practice, NATO ASI Series F: Computer and Systems Sciences 82, Springer, Berlin, 63-84.
A Polyhedral Study of the Asymmetric Travelling.. - Ascheuer, Fischetti, .. (1997) (4 citations) (Correct)
No context found.
G.L. Nemhauser and M.W.P. Savelsbergh. A cutting plane algorithm for the single machine scheduling problem with release dates. In M. Akguk, H. Hamacher, and S. Tufecki, editors, Combinatorial Optimization: New Frontiers in the Theory and Practice, NATO ASI Series F: Computer and Systems Sciences 82, pages 63--84. Springer--Verlag, 1992.
Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (1 citation) (Correct)
No context found.
G.L. Nemhauser and M.W.P. Savelsbergh (1992) "A cutting plane algorithm for the single-machine scheduling problem with release times", in: Combinatorial Optimization: New Frontiers in the Theory and Practice (M. Akgul, H. Hamacher, S. Tufecki, eds.) NATO ASI Series F: Computer and System Sciences 82, Springer, Berlin, 63--84.
Practical Problem Solving with Cutting Plane Algorithms.. - Jünger, Reinelt, Thienel (1994) (Correct)
No context found.
G.L. Nemhauser, M.W.P. Savelsbergh (1992), A cutting plane algorithm for the single machine scheduling problem with release times, in M. Akgul, H. Hamacher, S. Tufecki (eds.), Combinatorial Optimization: New Frontiers in the Theory and Practice, NATO ASI Series F: Computer and Systems Sciences 82, Springer-Verlag, 63-84.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC