Pages that link to "Item:Q1127153"
From MaRDI portal
The following pages link to Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153):
Displaying 17 items.
- Two-machine flow shop problems with a single server (Q880567) (← links)
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
- Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
- The convergence of stochastic algorithms solving flow shop scheduling (Q1608340) (← links)
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Formulating and solving production planning problems (Q1806882) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)
- Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666242) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- Genetic algorithms and simulated annealing for scheduling in agile manufacturing (Q5466739) (← links)
