Pages that link to "Item:Q2249033"
From MaRDI portal
The following pages link to Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033):
Displaying 10 items.
- Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
- Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
- An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times (Q6592926) (← links)
