Approximability of scheduling with fixed jobs
From MaRDI portal
(Redirected from Publication:1964484)
Recommendations
- Improved approximation algorithms for scheduling with fixed jobs
- Approximability of single machine scheduling with fixed jobs to minimize total completion time
- Approximation algorithms for scheduling with reservations
- On the optimality of approximation schemes for the classical scheduling problem
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bin packing can be solved within 1+epsilon in linear time
- Bounds for Certain Multiprocessing Anomalies
- Integer Programming with a Fixed Number of Variables
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
Cited in
(31)- scientific article; zbMATH DE number 1839470 (Why is no real title available?)
- On the optimality of approximation schemes for the classical scheduling problem
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- A scheduling problem with job values given as a power function of their completion times
- Approximation for scheduling on uniform nonsimultaneous parallel machines
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- Scheduling on same-speed processors with at most one downtime on each machine
- Fixed-order scheduling on parallel machines
- Approximation algorithms for scheduling with reservations
- The Fixed Job Schedule Problem with Working-Time Constraints
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- Improved approximation algorithms for scheduling with fixed jobs
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- FPT approximation algorithm for scheduling with memory constraints
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
- Multi-agent scheduling on a single machine with max-form criteria
- Scheduling and fixed-parameter tractability
- Approximation schemes for parallel machine scheduling with availability constraints
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Job release scheduling problem: complexity and an approximation algorithm
- Approximability of single machine scheduling with fixed jobs to minimize total completion time
- Formulating a scheduling problem with almost identical jobs by using positional completion times
- Scheduling on uniform processors with at most one downtime on each machine
- Tight approximation algorithms for scheduling with fixed jobs and nonavailability
- Fixed-time schedules for the processing of jobs when service completions are not observable
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- Scheduling partially ordered jobs faster than \(2^n\)
This page was built for publication: Approximability of scheduling with fixed jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964484)
