Pages that link to "Item:Q1042105"
From MaRDI portal
The following pages link to Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105):
Displaying 7 items.
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← 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)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
