Pages that link to "Item:Q1652608"
From MaRDI portal
The following pages link to A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608):
Displaying 6 items.
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem (Q5059236) (← links)
- A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)
