Pages that link to "Item:Q2883611"

The following pages link to Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611):

Displaying 9 items.

• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
• Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness (Q639194) (← links)
• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs (Q858442) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Uniform parallel machine scheduling with resource consumption constraint (Q2009726) (← links)
• Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
• Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic (Q3556554) (← links)