Pages that link to "Item:Q337272"

The following pages link to A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272):

Displaying 21 items.

• Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
• Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← links)
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (Q1374441) (← links)
• A hybrid metaheuristic algorithm to optimise a real-world robotic cell (Q1652331) (← links)
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• The job shop scheduling problem with convex costs (Q1754305) (← links)
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
• Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem (Q2031353) (← links)
• A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
• Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
• A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
• An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem (Q2411179) (← links)
• Matching formulation of the staff transfer problem: meta-heuristic approaches (Q2656523) (← links)
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
• A simulation optimization framework to solve stochastic flexible job-shop scheduling problems -- case: semiconductor manufacturing (Q6551110) (← links)
• An intensification approach based on fitness landscape characteristics for job shop scheduling problem (Q6645165) (← links)