Pages that link to "Item:Q941541"

The following pages link to A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541):

Displaying 13 items.

• Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← 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)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
• A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)