Pages that link to "Item:Q909574"

The following pages link to The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574):

Displaying 50 items.

• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
• Two-machine flow shop problems with a single server (Q880567) (← links)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• A note of using effective immune based approach for the flow shop scheduling with buffers (Q1045843) (← 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)
• Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
• An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling (Q1278192) (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
• A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
• Fuzzy sets and operations research: Perspectives (Q1282905) (← links)
• A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
• A tabu search approach for the flow shop scheduling problem (Q1296693) (← links)
• Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism (Q1307811) (← links)
• Some experiments with simulated annealing techniques for packing problems (Q1309920) (← links)
• Simulated annealing for resource-constrained scheduling (Q1309982) (← links)
• A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
• Unrelated parallel machine scheduling using local search (Q1341398) (← links)
• A genetic algorithm for flowshop sequencing (Q1342312) (← links)
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
• Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
• A systematic procedure for setting parameters in simulated annealing algorithms (Q1389193) (← links)
• Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• Improved genetic algorithm for the permutation flowshop scheduling problem. (Q1427101) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
• Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
• A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
• Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
• Routing and scheduling in a flexible job shop by tabu search (Q2366999) (← links)
• Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
• Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
• Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)
• An improved genetic algorithm for the flowshop scheduling problem (Q3596697) (← links)
• Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
• DLSP for two-stage multi-item batch production (Q4394231) (← links)