Pages that link to "Item:Q5469668"
From MaRDI portal
The following pages link to Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers (Q5469668):
Displaying 13 items.
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. (Q1427559) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163) (← links)
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353) (← links)
- A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production (Q2967577) (← links)
- A discrete group teaching optimization algorithm for solving many-objective sand casting whole process production scheduling problem (Q6551183) (← links)
- Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time (Q6593195) (← links)
