Pages that link to "Item:Q1806647"
From MaRDI portal
The following pages link to Heuristics for scheduling in a flow shop with multiple processors (Q1806647):
Displayed 14 items.
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case (Q864823) (← links)
- Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors (Q929755) (← links)
- Heuristic factory planning algorithm for advanced planning and scheduling (Q1010253) (← links)
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
- A heuristic algorithm for the hospital health examination scheduling problem (Q2426541) (← links)
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains (Q2491781) (← links)
- Bottleneck-focused scheduling for a hybrid flowshop (Q4474711) (← links)
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop (Q5466727) (← links)
- Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
- Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation (Q5485056) (← links)