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 13 items.
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← 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)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability (Q1941538) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)
- A note on minimizing total weighted completion time with an unexpected machine unavailable interval (Q2281620) (← 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)
