scientific article; zbMATH DE number 1301847
From MaRDI portal
Publication:4247069
zbMATH Open0944.90030MaRDI QIDQ4247069FDOQ4247069
Authors: George G. Polak 
Publication date: 26 September 2000
Title of this publication is not available (Why is that?)
Recommendations
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Scheduling permutation flow shops using the Lagrangian relaxation technique
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Study of job shop scheduling problem
- scientific article; zbMATH DE number 49601
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Extremal problems in graph theory (05C35)
Cited In (17)
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
- Title not available (Why is that?)
- Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application
- Solving makespan minimization problems with Lagrangean decomposition
- Implementation of scheduling algorithm for optimisation by Lagrangian decomposition model
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- Title not available (Why is that?)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Study of job shop scheduling problem
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Lagrangian relaxation of the generic materials and operations planning model
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Lagrangian bounds for just-in-time job-shop scheduling
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247069)
