Pages that link to "Item:Q4302712"

The following pages link to Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (Q4302712):

Displaying 50 items.

• A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
• A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
• Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
• Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
• A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
• A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
• Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• Two-machine flow shop problems with a single server (Q880567) (← links)
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
• Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
• A comparison of problem decomposition techniques for the FAP (Q972658) (← links)
• Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
• An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Parallel branch-and-bound methods for the job-shop scheduling problem (Q1273123) (← links)
• The life span method -- a new variant of local search (Q1275844) (← links)
• Comparison of iterative improvement techniques for schedule optimization (Q1278321) (← links)
• Benchmarks for shop scheduling problems (Q1296703) (← links)
• Unrelated parallel machine scheduling using local search (Q1341398) (← links)
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (Q1374441) (← links)
• A hierarchical approach for the FMS scheduling problem (Q1390190) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
• Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
• Decomposition methods for large job shops (Q1592580) (← links)
• A novel chaotic search for quadratic assignment problems (Q1598725) (← links)
• Performance evaluation of a parallel tabu search task scheduling algorithm (Q1606891) (← links)
• A tabu search approach to machine scheduling (Q1609892) (← 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)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
• An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
• Adaptive temperature control for simulated annealing: a comparative study (Q1886508) (← links)
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
• Focused simulated annealing search: An application to job shop scheduling (Q1919835) (← links)
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Parallel local search (Q1922627) (← links)
• Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling (Q2177824) (← links)
• Benchmarks for basic scheduling problems (Q2366085) (← links)
• Routing and scheduling in a flexible job shop by tabu search (Q2366999) (← links)
• A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
• A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
• An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)