Pages that link to "Item:Q5466734"
From MaRDI portal
The following pages link to Flowshop-scheduling problems with makespan criterion: a review (Q5466734):
Displaying 19 items.
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem (Q2901027) (← links)
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems (Q2967585) (← links)
- A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly (Q2997879) (← links)
- Review of the ordered and proportionate flow shop scheduling research (Q3120585) (← links)
- A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling (Q3163237) (← links)
- Scheduling semiconductor in-line steppers in new product/process introduction scenarios (Q3163705) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup (Q3621499) (← links)
- (Q3691405) (← links)
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194) (← links)
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem (Q6065188) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)