Pages that link to "Item:Q2273670"

The following pages link to Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670):

Displaying 21 items.

• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• Metaheuristics for the integrated machine allocation and layout problem (Q1042704) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem (Q1736622) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• A multi-objective variable neighborhood search algorithm for solving the hybrid flow shop problem (Q1791918) (← links)
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
• On VNS-GRASP and iterated greedy metaheuristics for solving hybrid flow shop scheduling problem with uniform parallel machines and sequence independent setup time (Q2093903) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals (Q2147157) (← links)
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time (Q2629637) (← links)
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant (Q2664430) (← links)
• Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
• Metaheuristics for meltshop scheduling in the steel industry (Q5428974) (← links)
• Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)
• A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
• Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time (Q6593195) (← links)