The following pages link to (Q3892056):
Displayed 8 items.
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Scheduling linear deteriorating jobs with an availability constraint on a single machine (Q2508968) (← links)
- Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)