scientific article; zbMATH DE number 1301847
From MaRDI portal
Publication:4247069
Extremal problems in graph theory (05C35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
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
Cited in
(20)- Solving makespan minimization problems with Lagrangean decomposition
- Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application
- Scheduling permutation flow shops using the Lagrangian relaxation technique
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- Lagrangian relaxation of the generic materials and operations planning model
- Lagrangian bounds for just-in-time job-shop scheduling
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Implementation of scheduling algorithm for optimisation by Lagrangian decomposition model
- Study of job shop scheduling problem
- scientific article; zbMATH DE number 4199945 (Why is no real title available?)
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
- scientific article; zbMATH DE number 49601 (Why is no real title available?)
- scientific article; zbMATH DE number 1263270 (Why is no real title available?)
- scientific article; zbMATH DE number 1556701 (Why is no real title available?)
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
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)
