Pages that link to "Item:Q1887766"
From MaRDI portal
The following pages link to A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766):
Displayed 14 items.
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time (Q2384652) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← 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)
- Permutation, no-wait, no-idle flow shop problems (Q4971620) (← links)
- A systematic literature review on no-idle flow shop scheduling problem (Q6130678) (← links)
- A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)