Pages that link to "Item:Q4933629"
From MaRDI portal
The following pages link to New heuristics for flow shop problem to minimize makespan (Q4933629):
Displaying 12 items.
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
- Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660) (← links)
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
- A local search algorithm for the flow shop scheduling problem with release dates (Q1723292) (← links)
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates (Q2792935) (← links)
- Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates (Q6094571) (← links)
