Solutions to the Constrained Flowshop Sequencing Problem
From MaRDI portal
Cited in
(21)- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- New heuristics for no-wait flowshops to minimize makespan.
- On the exact solution of the no-wait flow shop problem with due date constraints
- A comprehensive review and evaluation of permutation flowshop heuristics
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- A new heuristic for the n-job, M-machine flow-shop problem
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- A survey and evaluation of static flowshop scheduling heuristics
- Design and scheduling of flexible assembly lines for printed circuit boards
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- Flowshop-scheduling problems with makespan criterion: a review
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
This page was built for publication: Solutions to the Constrained Flowshop Sequencing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4114935)
