Pages that link to "Item:Q2476258"
From MaRDI portal
The following pages link to Approximation algorithms for problems in scheduling with set-ups (Q2476258):
Displaying 13 items.
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- Online machine scheduling with family setups (Q2821094) (← links)
- (Q2957491) (← links)
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem (Q3220332) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- Survey of scheduling research involving setup times (Q4546846) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions (Q4681718) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
