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 29 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)
• Lower bounds for parallel machine scheduling problems (Q947338) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← 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)
• Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
• A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
• Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
• On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← 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)
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← 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)
• Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580) (← links)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
• Scheduling of a single machine to minimize total weighted completion time subject to release dates (Q3328239) (← links)
• (Q4017560) (← links)
• A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)