Pages that link to "Item:Q915635"
From MaRDI portal
The following pages link to Some efficient heuristic methods for the flow shop sequencing problem (Q915635):
Displayed 20 items.
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
- Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)