Pages that link to "Item:Q1129956"

The following pages link to Weighted flow time bounds for scheduling identical processors (Q1129956):

Displaying 12 items.

• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← 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)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← 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)
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)