Pages that link to "Item:Q958459"
From MaRDI portal
The following pages link to Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459):
Displaying 3 items.
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization (Q2664442) (← links)
