Pages that link to "Item:Q2499163"
From MaRDI portal
The following pages link to A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163):
Displaying 12 items.
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- Hybrid flowshop scheduling with machine and resource-dependent processing times (Q534872) (← links)
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries (Q927194) (← links)
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
- Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678) (← links)
- A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines (Q4634331) (← links)
- Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain (Q5494706) (← links)
