Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
From MaRDI portal
Publication:733544
DOI10.1016/J.COR.2009.04.008zbMATH Open1171.90405OpenAlexW1990514741MaRDI QIDQ733544FDOQ733544
Authors: Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi 
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.008
Recommendations
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- scientific article; zbMATH DE number 1301847
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
- scientific article; zbMATH DE number 49601
Cites Work
- Tabu search for total tardiness minimization in flowshop scheduling problems
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- Modeling realistic hybrid flexible flowshop scheduling problems
- Surrogate gradient algorithm for Lagrangian relaxation
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Benchmarks for basic scheduling problems
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- New bundle methods for solving Lagrangian relaxation dual problems
Cited In (16)
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines
- Practical solutions for a dock assignment problem with trailer transportation
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
- Optimal solutions for a dock assignment problem with trailer transportation
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- Lagrangian relaxation algorithm for scheduling problems of reentrant hybrid flow shops
- Lagrangian relaxation of the generic materials and operations planning model
- Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Lagrangian relaxation algorithm for real-time hybrid flowshop scheduling with no-wait in process
This page was built for publication: Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733544)
