Pages that link to "Item:Q5289348"

The following pages link to Improving the Efficiency of Tabu Search for Machine Sequencing Problems (Q5289348):

Displaying 24 items.

• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
• Heuristics for the flow line problem with setup costs (Q1303708) (← links)
• Unrelated parallel machine scheduling using local search (Q1341398) (← links)
• Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
• Using tabu search to solve the common due date early/tardy machine scheduling problem (Q1373879) (← links)
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
• Common due-date determination and sequencing using tabu search (Q1915955) (← links)
• A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• Case-based reasoning and improved adaptive search for project scheduling (Q4487088) (← links)
• Hybrid Genetic Algorithm and Invasive Weed Optimization via Priority Based Encoding for Location-Allocation Decisions in a Three-Stage Supply Chain (Q4978465) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)
• Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)