Pages that link to "Item:Q1806647"

The following pages link to Heuristics for scheduling in a flow shop with multiple processors (Q1806647):

Displaying 27 items.

• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
• A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
• Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case (Q864823) (← links)
• Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors (Q929755) (← links)
• Heuristic factory planning algorithm for advanced planning and scheduling (Q1010253) (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
• Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems (Q1725606) (← links)
• On the optimality conditions of the two-machine flow shop problem (Q1754105) (← links)
• Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← 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)
• A heuristic algorithm for the hospital health examination scheduling problem (Q2426541) (← links)
• A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains (Q2491781) (← links)
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time (Q2629637) (← links)
• Capacity-filtering algorithms for finite-capacity planning of a flexible flow line (Q3055437) (← links)
• Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis (Q3163224) (← links)
• Bottleneck-focused scheduling for a hybrid flowshop (Q4474711) (← links)
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop (Q5466727) (← links)
• Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
• Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation (Q5485056) (← links)