Pages that link to "Item:Q1266724"
From MaRDI portal
The following pages link to A general lower bound for the makespan problem (Q1266724):
Displaying 14 items.
- Lower bounds for scheduling on identical parallel machines with heads and tails (Q596460) (← links)
- A note on Graham's bound (Q916353) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness (Q1011327) (← links)
- Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)
- Operations research at container terminals: a literature update (Q2480797) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem (Q4005798) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)