Pages that link to "Item:Q5689787"
From MaRDI portal
The following pages link to A Note on Heuristics of Flow-Shop Scheduling (Q5689787):
Displayed 10 items.
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- A modification to the CGPS algorithm for three-machine flow shop scheduling (Q2766119) (← links)
- (Q4487091) (← links)
- A worst-case analysis of the three-machine flow shop scheduling (Q4812717) (← links)
- Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)