Pages that link to "Item:Q342073"
From MaRDI portal
The following pages link to Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073):
Displaying 11 items.
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343) (← links)
