Pages that link to "Item:Q4114935"
From MaRDI portal
The following pages link to Solutions to the Constrained Flowshop Sequencing Problem (Q4114935):
Displaying 21 items.
- Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- No-wait flowshops with bicriteria of makespan and maximum lateness. (Q1410329) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- New heuristics for no-wait flowshops to minimize makespan. (Q1413816) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
- A new heuristic for the n-job, M-machine flow-shop problem (Q2277356) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS (Q2911576) (← links)
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
- A survey and evaluation of static flowshop scheduling heuristics (Q3329204) (← links)
- Design and scheduling of flexible assembly lines for printed circuit boards (Q4398942) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
