Pages that link to "Item:Q3783064"

The following pages link to An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime (Q3783064):

Displaying 15 items.

• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← 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)
• Weighted flow time bounds for scheduling identical processors (Q1129956) (← links)
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← links)
• Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
• Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← 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)
• Parallel flowshop scheduling using Tabu search (Q4474674) (← links)