A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
From MaRDI portal
Publication:299834
DOI10.1016/j.ejor.2013.11.010zbMath1338.90176OpenAlexW2017979853MaRDI QIDQ299834
Kun Mao, Quan-ke Pan, Xinfu Pang, Tian-You Chai
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.010
Related Items (14)
Models for scheduling charges in continuous casting: application to a Brazilian steel plant ⋮ A new mixed integer programming model for curriculum balancing: application to a Turkish university ⋮ A soft-decision based two-layered scheduling approach for uncertain steelmaking-continuous casting process ⋮ An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling ⋮ Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm ⋮ Harris Hawks optimization with information exchange ⋮ Matheuristics: survey and synthesis ⋮ Modeling and solving the steelmaking and casting scheduling problem ⋮ A multi-objective hot-rolling scheduling problem in the compact strip production ⋮ A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea ⋮ A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ An approach for bi-objective maintenance scheduling on a networked system with limited resources ⋮ Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the parallel flow shop problem
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
- Scheduling a hybrid flowshop with batch production at the last stage
- Modeling realistic hybrid flexible flowshop scheduling problems
- A novel hybrid algorithm for scheduling steel-making continuous casting production
- Scheduling around a small common due date
- Convergence of a simple subgradient level method
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
- A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
- A descent proximal level bundle method for convex nondifferentiable optimization
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Incremental Subgradient Methods for Nondifferentiable Optimization
- A scheduling system for the steelmaking-continuous casting process. A case study from the steel-making industry
- Steel-making process scheduling using Lagrangian relaxation
- Survey of Bundle Methods for Nonsmooth Optimization
- Auction-based approach to resolve the scheduling problem in the steel making process
- A review of planning and scheduling systems and methods for integrated steel production
This page was built for publication: A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
