Pages that link to "Item:Q1296660"

The following pages link to A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660):

Displaying 32 items.

• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• Exact resolution of the two-stage hybrid flow shop with dedicated machines (Q479265) (← links)
• Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises (Q492824) (← links)
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← 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)
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
• Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
• Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations (Q1717811) (← links)
• Heuristics for periodical batch job scheduling in a MapReduce computing framework (Q1750408) (← links)
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← 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)
• Flow-shop scheduling for three serial stations with the last two duplicate (Q1886869) (← 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)
• Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems (Q2147094) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines (Q2456642) (← links)
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
• A Two-Stage Flexible Flowshop Problem with Deterioration (Q3511377) (← links)
• A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
• Méthode heuristique pour le problème de flow shop hybride avec machines dédiées (Q3644816) (← links)
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem (Q4274645) (← links)
• (Q5486497) (← links)
• A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)