Surrogate duality relaxation for job shop scheduling
type: Item
instance of: scholarly article
title: Surrogate duality relaxation for job shop scheduling
zbMATH Open document ID: 0498.90045
DOI: 10.1016/0166-218X(83)90016-1
author: B. J. Lageweg
author: Marshall L. Fisher
author: Jan Karel Lenstra
author: Alexander H. G. Rinnooy Kan
published in: Discrete Applied Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3786488
zbMATH Keywords: surrogate duality bounds
zbMATH Keywords: job shop scheduling
zbMATH Keywords: capacity constraints
zbMATH Keywords: precedence constraints
zbMATH Keywords: replacing constraints by weighted sums
MaRDI profile type: Publication
cites work: On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
cites work: A Method of Solution for General Machine-Scheduling Problems
cites work: Q4658190
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Calculating surrogate constraints
cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
cites work: A dual algorithm for the one-machine scheduling problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4145425
cites work: A Direct Search Method to Locate Negative Cycles in a Graph
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Q4178782
cites work: Surrogate Constraints
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q3217922
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: Job-Shop Scheduling by Implicit Enumeration
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Q4124328
cites work: The B<scp>oxstep</scp> Method for Large-Scale Optimization
cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
cites work: Q5595902
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
cites work: Convergence rate of the gradient descent method with dilatation of the space
full work available at URL: 0166-218x(83)90016-1
OpenAlex ID: W2094331967
description: scientific article; zbMATH DE number 3786488