Pages that link to "Item:Q809880"

The following pages link to Branch and bound algorithm for the flow shop with multiple processors (Q809880):

Displaying 50 items.

• A two-stage hybrid flow shop with dedicated machines at the first stage (Q336642) (← links)
• Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage (Q337499) (← links)
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines (Q622160) (← links)
• A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem (Q730912) (← links)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
• Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
• A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
• Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
• A two-stage hybrid flowshop with uniform machines and setup times (Q969780) (← links)
• Minimizing makespan in two-stage hybrid cross docking scheduling problem (Q1001000) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• Scheduling of a single crane in batch annealing process (Q1017463) (← links)
• Global lower bounds for flow shops with multiple processors (Q1129960) (← links)
• A multi-stage parallel-processor flowshop problem with minimum flowtime (Q1197966) (← links)
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667) (← links)
• Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
• Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
• Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment (Q1319566) (← links)
• Scheduling a two-stage hybrid flowshop with separable setup and removal times (Q1333533) (← links)
• Modelling multi-stage manufacturing systems for efficient scheduling (Q1582191) (← links)
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
• The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← 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)
• Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
• A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (Q1991311) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• A scheduling problem in the baking industry (Q2336885) (← links)
• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
• Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines (Q3163722) (← links)
• Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem (Q3541175) (← links)
• Two-stage hybrid flow shop with recirculation (Q3563625) (← links)
• Scheduling flexible flow lines with no in-process buffers (Q4398979) (← links)
• Continuous flow models for batch manufacturing: a basis for a hierarchical approach (Q4398998) (← links)
• Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation (Q4420128) (← links)
• Steel-making process scheduling using Lagrangian relaxation (Q4443361) (← links)
• Scheduling in dial-indexed production lines (Q4474678) (← links)
• Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops (Q4487091) (← links)
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)
• Sequencing a hybrid two-stage flowshop with dedicated machines (Q4706331) (← links)
• FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors (Q4718639) (← links)