Pages that link to "Item:Q4834245"

The following pages link to Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage (Q4834245):

Displaying 33 items.

• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• Hybrid flowshop scheduling with interstage job transportation (Q489104) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
• Flowshop scheduling with interstage job transportation (Q892841) (← links)
• A two-stage hybrid flowshop with uniform machines and setup times (Q969780) (← 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)
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups (Q1291587) (← links)
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
• Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← 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)
• Modelling multi-stage manufacturing systems for efficient scheduling (Q1582191) (← links)
• The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
• Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations (Q1717811) (← links)
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling (Q1869668) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
• Optimizing resource speed for two-stage real-time tasks (Q2362234) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines (Q2456642) (← links)
• Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
• Scheduling manufacturing systems for delayed product differentiation in agile manufacturing (Q4807200) (← links)
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
• Preemptive hybrid flowshop scheduling problem of interval orders (Q5956203) (← links)