Pages that link to "Item:Q1129956"
From MaRDI portal
The following pages link to Weighted flow time bounds for scheduling identical processors (Q1129956):
Displayed 4 items.
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← 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)