Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
From MaRDI portal
Publication:4047423
Cited in
(39)- On linear lower bounds for the resource constrained project scheduling problem.
- Dynamic scheduling in manufacturing systems using Brownian approximations
- An exact algorithm for single-machine scheduling without machine idle time
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
- Principal direction search: A new method of search for unconstrained LP formulations
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
- Large-scale unit commitment under uncertainty: an updated literature survey
- Mathematical programming formulations for machine scheduling: A survey
- A dual algorithm for the one-machine scheduling problem
- The job shop scheduling problem: Conventional and new solution techniques
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Some relationships between lagrangian and surrogate duality in integer programming
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Minimizing the weighted sum of squared tardiness on a single machine
- COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
- Modeling and Managing Uncertainty in Process Planning and Scheduling
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- The omnipresence of Lagrange
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Surrogate duality relaxation for job shop scheduling
- Large-scale unit commitment under uncertainty
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Deterministic job-shop scheduling: Past, present and future
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- scientific article; zbMATH DE number 4199945 (Why is no real title available?)
- Two level heuristic for the resource constrained scheduling problem
- Cellular control of manufacturing systems
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- A comparative study of computational procedures for the resource constrained project scheduling problem
- Fuzzy job-shop scheduling problems: a review
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- A Lagrangian decomposition scheme for choice-based optimization
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Ordering scheduling problem in manufacturing systems
- An interactive decision support system for the resource constrained scheduling problem
- Symmetric duality for disjunctive programming with absolute value functionals
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
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)
