Pages that link to "Item:Q878937"
From MaRDI portal
The following pages link to Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937):
Displayed 5 items.
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking (Q954039) (← links)
- The museum visitor routing problem (Q969135) (← links)
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← 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)