Pages that link to "Item:Q1266724"
From MaRDI portal
The following pages link to A general lower bound for the makespan problem (Q1266724):
Displayed 5 items.
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Operations research at container terminals: a literature update (Q2480797) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)