Pages that link to "Item:Q1129960"

The following pages link to Global lower bounds for flow shops with multiple processors (Q1129960):

Displaying 19 items.

• Machine scheduling in underground mining: an application in the potash industry (Q280169) (← links)
• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
• Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
• Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling (Q1869668) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← 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)
• An integrated approach for modeling and solving the scheduling problem of container handling systems (Q2508124) (← links)
• Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines (Q3605446) (← links)
• Bottleneck-focused scheduling for a hybrid flowshop (Q4474711) (← links)
• Preemptive hybrid flowshop scheduling problem of interval orders (Q5956203) (← links)