Pages that link to "Item:Q1038328"
From MaRDI portal
The following pages link to Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328):
Displaying 10 items.
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- Convex programming for scheduling unrelated parallel machines (Q3581397) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)
