Pages that link to "Item:Q2003565"
From MaRDI portal
The following pages link to Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565):
Displaying 8 items.
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660) (← links)
- A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation (Q1998264) (← links)
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem (Q2669577) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
- A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)