Pages that link to "Item:Q965714"

The following pages link to Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714):

Displayed 4 items.

• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) ‎ (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) ‎ (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) ‎ (← links)
• Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) ‎ (← links)