Pages that link to "Item:Q1592744"

The following pages link to Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744):

Displaying 27 items.

• Integrated cost optimization in a two-stage, automotive supply chain (Q342249) (← links)
• A variable depth search branching (Q453047) (← links)
• Local adjustments: A general algorithm (Q707084) (← links)
• A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• Heuristic factory planning algorithm for advanced planning and scheduling (Q1010253) (← links)
• A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905) (← links)
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
• Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
• A heuristic algorithm for the hospital health examination scheduling problem (Q2426541) (← links)
• Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks (Q2489269) (← links)
• An integrated approach for modeling and solving the scheduling problem of container handling systems (Q2508124) (← links)
• A local search using solution fragments for the 2-machine bicriteria scheduling problem (Q2643628) (← links)
• Performance guarantees of local search for multiprocessor scheduling (Q2892310) (← links)
• Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks (Q3003281) (← links)
• Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study (Q3055316) (← links)
• A local search method for permutation flow shop scheduling (Q3433488) (← links)
• Two-stage hybrid flow shop with recirculation (Q3563625) (← links)
• Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (Q4671306) (← links)
• Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
• Genetic algorithms and simulated annealing for scheduling in agile manufacturing (Q5466739) (← links)