Pages that link to "Item:Q941541"
From MaRDI portal
The following pages link to A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541):
Displayed 4 items.
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- A global constraint for total weighted completion time for unary resources (Q2430362) (← 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 new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)