Chapter 8 Mathematical programming models and methods for production planning and scheduling
Author:
- Jeremy F. ShapiroJSJeremy F. Shapiro
- 1 January 1993
- book chapter
- Published by Elsevier
- Vol. 4, 371-443
Abstract
No abstract availableThis publication has 68 references indexed in Scilit:
- Mslip: A computer code for the multistage stochastic linear programming problemMathematical Programming, 1990
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- Valid inequalities for mixed 0–1 programsDiscrete Applied Mathematics, 1986
- Feasible path optimization with sequential modular simulatorsComputers & Chemical Engineering, 1985
- Improved infeasible path optimization for sequential modular simulators—II: the optimization algorithmComputers & Chemical Engineering, 1985
- Some relationships between lagrangian and surrogate duality in integer programmingMathematical Programming, 1979
- A Survey of Lagrangean Techniques for Discrete Optimization1979
- Disjunctive Programming1979
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints1978
- Lagrangean relaxation for integer programming1974