Pages that link to "Item:Q1919850"

The following pages link to A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem (Q1919850):

Displaying 15 items.

• An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
• On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
• A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• No-wait flowshops with bicriteria of makespan and maximum lateness. (Q1410329) (← links)
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• A genetic algorithm for solving the economic lot scheduling problem in flow shops (Q3518466) (← links)
• Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
• A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)