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):
Displaying 11 items.
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
- 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)
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
- On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
- Frameworks for adaptable scheduling algorithms (Q1976517) (← 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)
- Heuristic algorithms for the optimization of total weighted completion time for asynchronous transmission in a packet data transmission system (Q2786900) (← links)
- Minimizing the sum of weighted completion times of n-independent jobs when resource availability varies over time: Performance of a simple priority rule (Q3768666) (← links)
