Pages that link to "Item:Q896269"
From MaRDI portal
The following pages link to Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269):
Displaying 11 items.
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- (Q5090421) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- (Q5875469) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones (Q6130706) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds (Q6589760) (← links)
