Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
From MaRDI portal
Publication:841595
DOI10.1007/s10878-007-9102-4zbMath1170.90393OpenAlexW2016371955MaRDI QIDQ841595
Publication date: 18 September 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9102-4
Related Items
Scheduling jobs and maintenance activities on parallel machines, A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization, Online and semi-online scheduling to minimize makespan on single machine with an availability constraint, Semi-online scheduling on a single machine with unexpected breakdown, Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval, Minimizing total weighted late work on a single-machine with non-availability intervals, Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines, Supply chain scheduling problem in the hospital with periodic working time on a single machine, An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown, Two-agent single-machine scheduling with release dates to minimize the makespan, Equivalence of some different maintenance activities in single-machine scheduling, Integrated scheduling of production and delivery on a single machine with availability constraint, Single-machine scheduling with machine unavailability periods and resource dependent processing times, Order acceptance and scheduling with machine availability constraints, Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date, A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability, Approximation algorithms for single machine scheduling with one unavailability period, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Online scheduling on two parallel machines with release dates and delivery times
Cites Work
- Improved algorithms for two single machine scheduling problems
- A note on worst-case performance of heuristics for maintenance scheduling problems
- New single machine and job-shop scheduling problems with availability constraints
- Weighted flow time bounds for scheduling identical processors
- Fast approximation algorithm for job sequencing with deadlines
- The one-machine sequencing problem
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Optimal parallel machines scheduling with availability constraints
- Scheduling with limited machine availability
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- Machine scheduling with an availability constraint
- A comment on scheduling two parallel machines with capacity constraints
- Scheduling the maintenance on a single machine
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
