Pages that link to "Item:Q1772973"
From MaRDI portal
The following pages link to Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973):
Displayed 8 items.
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)