Pages that link to "Item:Q2371343"
From MaRDI portal
The following pages link to Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343):
Displayed 18 items.
- Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
- Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- Integrated scheduling of production and delivery on a single machine with availability constraint (Q476906) (← links)
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
- Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← 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 batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← links)
- Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← links)
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← 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)
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint (Q2429001) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Single Machine Scheduling with an Availability Constraint and Rejection (Q2931173) (← links)