Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
From MaRDI portal
Publication:2371343
DOI10.1016/j.ejor.2006.10.005zbMath1180.90114OpenAlexW1993862978MaRDI QIDQ2371343
Publication date: 4 July 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.005
Related Items (18)
Approximation algorithms for the single-machine scheduling with a period of maintenance ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates ⋮ Single Machine Scheduling with an Availability Constraint and Rejection ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Supply chain scheduling problem in the hospital with periodic working time on a single machine ⋮ Minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ Single-machine scheduling with periodic maintenance to minimize makespan revisited ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates ⋮ Integrated scheduling of production and delivery on a single machine with availability constraint ⋮ Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval ⋮ Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
Cites Work
This page was built for publication: Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
