Pages that link to "Item:Q1342312"
From MaRDI portal
The following pages link to A genetic algorithm for flowshop sequencing (Q1342312):
Displaying 50 items.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← links)
- Impact of the replacement heuristic in a grouping genetic algorithm. (Q1422353) (← links)
- Improved genetic algorithm for the permutation flowshop scheduling problem. (Q1427101) (← links)
- An ant colony system for permutation flow-shop sequencing (Q1433172) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
- GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs (Q1698077) (← links)
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics (Q1776952) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Formulating and solving production planning problems (Q1806882) (← links)
- A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
- Flow-shop scheduling for three serial stations with the last two duplicate (Q1886869) (← links)
- A generalized permutation approach to job shop scheduling with genetic algorithms (Q1908992) (← links)
- Hybrid genetic algorithms for bin-packing and related problems (Q1919849) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A network parallel genetic algorithm for the one machine sequencing problem (Q1962970) (← links)
- Cloud manufacturing -- scheduling as a service for sheet metal manufacturing (Q2002866) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan (Q2369202) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- Setup coordination between two stages of a production system: a multi-objective evolutionary approach (Q2379870) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) (← links)
- Harmony search algorithm with dynamic control parameters (Q2445213) (← links)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- Design of an adaptive mutation operator in an electrical load management case study (Q2475849) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- An evolutionary approach to rehabilitation patient scheduling: A case study (Q2482797) (← links)
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
- Stochastic optimization using simulated annealing with hypothesis test (Q2489372) (← links)
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems (Q2518432) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups (Q2642312) (← links)
- A heuristic genetic algorithm for flowshop scheduling (Q2768214) (← links)
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems (Q2911576) (← links)
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems (Q2967585) (← links)
