Pages that link to "Item:Q1119464"

The following pages link to A new heuristic method for the flow shop sequencing problem (Q1119464):

Displaying 50 items.

• Multipath adaptive tabu search for a vehicle control problem (Q411085) (← links)
• On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
• Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Two-machine flow shop problems with a single server (Q880567) (← links)
• Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
• Some efficient heuristic methods for the flow shop sequencing problem (Q915635) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
• Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
• Finding a feasible course schedule using Tabu search (Q1186313) (← links)
• Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
• A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← 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)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
• A tabu search Hooke and Jeeves algorithm for unconstrained optimization (Q1280136) (← 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)
• Heuristics for the flow line problem with setup costs (Q1303708) (← links)
• Deterministic job-shop scheduling problems with capacity focus (Q1308500) (← links)
• Unrelated parallel machine scheduling using local search (Q1341398) (← links)
• Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
• The tabu search metaheuristic: How we used it (Q1356212) (← links)
• Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
• Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← links)
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. (Q1399596) (← links)
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
• An ant colony system for permutation flow-shop sequencing (Q1433172) (← links)
• Scheduling a flowline manufacturing cell with sequence dependent family setup times (Q1580980) (← links)
• Sequencing of jobs in some production system (Q1582040) (← 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)
• The hot strip mill production scheduling problem: A tabu search approach (Q1609896) (← 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)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← 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 travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) (← links)
• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems (Q1887767) (← links)
• A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
• On a scheduling problem in a robotized analytical system (Q1917278) (← links)