Pages that link to "Item:Q1357780"

The following pages link to Scheduling a two-stage hybrid flow shop with parallel machines at the first stage (Q1357780):

Displaying 28 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)
• A heuristic method for two-stage hybrid flow shop with dedicated machines (Q339604) (← links)
• Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines (Q622160) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← 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)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
• Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← 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)
• A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163) (← links)
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
• Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic (Q3055403) (← links)
• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines (Q3163722) (← links)
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach (Q3527930) (← links)
• (Q4487091) (← links)
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)