Pages that link to "Item:Q1317043"

The following pages link to Scheduling identical parallel machines to minimize total weighted completion time (Q1317043):

Displaying 19 items.

• Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
• Weighted flow time bounds for scheduling identical processors (Q1129956) (← links)
• Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608) (← links)
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
• A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)