Pages that link to "Item:Q2400044"
From MaRDI portal
The following pages link to An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044):
Displaying 10 items.
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
- A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines (Q2942689) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)
