Pages that link to "Item:Q947338"
From MaRDI portal
The following pages link to Lower bounds for parallel machine scheduling problems (Q947338):
Displayed 6 items.
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)