Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
From MaRDI portal
Publication:4047423
DOI10.1287/OPRE.21.5.1114zbMATH Open0294.90085OpenAlexW2137920965MaRDI QIDQ4047423FDOQ4047423
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.5.1114
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)
Cited In (39)
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
- A comparative study of computational procedures for the resource constrained project scheduling problem
- Some relationships between lagrangian and surrogate duality in integer programming
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
- Large-scale unit commitment under uncertainty: an updated literature survey
- The omnipresence of Lagrange
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- Four solution techniques for a general one machine scheduling problem. A comparative study
- COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
- An interactive decision support system for the resource constrained scheduling problem
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Mathematical programming formulations for machine scheduling: A survey
- Ordering scheduling problem in manufacturing systems
- A dual algorithm for the one-machine scheduling problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Symmetric duality for disjunctive programming with absolute value functionals
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Cellular control of manufacturing systems
- Large-scale unit commitment under uncertainty
- Title not available (Why is that?)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- Surrogate duality relaxation for job shop scheduling
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Two level heuristic for the resource constrained scheduling problem
- An exact algorithm for single-machine scheduling without machine idle time
- The job shop scheduling problem: Conventional and new solution techniques
- A Lagrangian decomposition scheme for choice-based optimization
- On linear lower bounds for the resource constrained project scheduling problem.
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Modeling and Managing Uncertainty in Process Planning and Scheduling
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Deterministic job-shop scheduling: Past, present and future
- Principal direction search: A new method of search for unconstrained LP formulations
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Fuzzy job-shop scheduling problems: a review
- Minimizing the weighted sum of squared tardiness on a single machine
- Dynamic scheduling in manufacturing systems using Brownian approximations
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
This page was built for publication: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047423)