Pages that link to "Item:Q1310018"
From MaRDI portal
The following pages link to A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018):
Displayed 5 items.
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- Weighted flow time bounds for scheduling identical processors (Q1129956) (← links)
- Frameworks for adaptable scheduling algorithms (Q1976517) (← 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)