Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness

DOI10.1016/j.cor.2009.04.008zbMath1171.90405OpenAlexW1990514741MaRDI QIDQ733544

Yuichiro Hiranaka, Masahiro Inuiguchi, Tatsushi Nishi

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

zbMATH Keywords

Lagrangian relaxationdynamic programmingcut generationhybrid flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (10)

A new mixed integer programming model for curriculum balancing: application to a Turkish university ⋮ A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm ⋮ A dynamic programming-based matheuristic for the dynamic berth allocation problem ⋮ A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles ⋮ A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ 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

Cites Work

• New bundle methods for solving Lagrangian relaxation dual problems
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
• Modeling realistic hybrid flexible flowshop scheduling problems
• Surrogate gradient algorithm for Lagrangian relaxation
• Tabu search for total tardiness minimization in flowshop scheduling problems
• 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
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

This page was built for publication: Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness