Pages that link to "Item:Q2003576"
From MaRDI portal
The following pages link to A branch and price algorithm for single-machine completion time variance (Q2003576):
Displaying 3 items.
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
- A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)