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

DOI10.1016/J.COR.2009.04.008MaRDI QIDQ733544zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic programmingLagrangian relaxationcut generationhybrid flowshop scheduling

Mathematics Subject Classification ID

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

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

• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
• A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• Benchmarks for basic scheduling problems
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• Modeling realistic hybrid flexible flowshop scheduling problems
• New bundle methods for solving Lagrangian relaxation dual problems
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• Surrogate gradient algorithm for Lagrangian relaxation
• Tabu search for total tardiness minimization in flowshop scheduling problems

Cited in

(16)

• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
• Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs
• Lagrangian relaxation algorithm for scheduling problems of reentrant hybrid flow shops
• Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
• 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
• Practical solutions for a dock assignment problem with trailer transportation
• Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
• A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines
• Lagrangian relaxation algorithm for real-time hybrid flowshop scheduling with no-wait in process
• 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
• A new mixed integer programming model for curriculum balancing: application to a Turkish university

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)