Pages that link to "Item:Q1342286"

The following pages link to Minimizing makespan in hybrid flowshops (Q1342286):

Displaying 50 items.

• A two-stage hybrid flow shop with dedicated machines at the first stage (Q336642) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines (Q622160) (← 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)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines (Q881563) (← links)
• Scheduling problems in master-slave model (Q940888) (← links)
• Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
• Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← 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)
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups (Q1291587) (← links)
• Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines (Q1295836) (← links)
• Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660) (← links)
• Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
• Heuristic algorithms for the two-stage hybrid flowshop problem (Q1371955) (← links)
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
• An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. (Q1410120) (← links)
• Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
• Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
• Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
• Heuristics for periodical batch job scheduling in a MapReduce computing framework (Q1750408) (← links)
• On the optimality conditions of the two-machine flow shop problem (Q1754105) (← links)
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
• Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
• Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
• Improved approximation algorithms for two-stage flexible flow shop scheduling (Q2025092) (← links)
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
• Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
• Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
• A note on makespan minimization in two-stage flexible flow shops with uniform machines (Q2433488) (← links)
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
• Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
• An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
• The master-slave paradigm in parallel computer and industrial settings (Q2564882) (← links)
• Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)