Pages that link to "Item:Q4005798"

The following pages link to New Bounds for the Identical Parallel Processor Weighted Flow Time Problem (Q4005798):

Displaying 15 items.

• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← 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 general lower bound for the makespan problem (Q1266724) (← links)
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← 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)
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)