A dual algorithm for the one-machine scheduling problem
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 11 (1), 229-251
- https://doi.org/10.1007/bf01580393
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Validation of subgradient optimizationMathematical Programming, 1974
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- An experimental comparison of solution algorithms for the single‐machine tardiness problemNaval Research Logistics Quarterly, 1974
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. TheoryOperations Research, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973
- Relaxation Methods for Pure and Mixed Integer Programming ProblemsManagement Science, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961