Pages that link to "Item:Q973008"
From MaRDI portal
The following pages link to Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008):
Displayed 7 items.
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
- Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)