Surrogate duality relaxation for job shop scheduling
- 31 January 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (1) , 65-75
- https://doi.org/10.1016/0166-218x(83)90016-1
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Calculating surrogate constraintsMathematical Programming, 1980
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problemNaval Research Logistics Quarterly, 1973
- An Implicit Enumeration Algorithm for the Machine Sequencing ProblemManagement Science, 1971
- A Method of Solution for General Machine-Scheduling ProblemsOperations Research, 1970