Pages that link to "Item:Q5491459"
From MaRDI portal
The following pages link to A linear time approximation scheme for the single machine scheduling problem with controllable processing times (Q5491459):
Displaying 9 items.
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- Semi-definite relaxation algorithm for single machine scheduling with controllable processing times (Q1774270) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- (Q4793089) (← links)