Approximability of scheduling with fixed jobs
From MaRDI portal
Publication:1964484
DOI<267::AID-JOS31>3.0.CO;2-H 10.1002/(SICI)1099-1425(199911/12)2:6<267::AID-JOS31>3.0.CO;2-HzbMath0953.90025MaRDI QIDQ1964484
Angelika Steger, Horst Weisser, Mark Scharbrodt
Publication date: 1 February 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Approximation algorithms for scheduling with reservations, Minimizing total weighted completion time with an unexpected machine unavailable interval, Scheduling on same-speed processors with at most one downtime on each machine, Approximation schemes for parallel machine scheduling with availability constraints, Approximability of single machine scheduling with fixed jobs to minimize total completion time, Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption, Approximation for scheduling on uniform nonsimultaneous parallel machines, Scheduling on uniform processors with at most one downtime on each machine, Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria, Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation, Minimizing total weighted late work on a single-machine with non-availability intervals, Single machine unbounded parallel-batch scheduling with forbidden intervals, Multi-agent scheduling on a single machine with max-form criteria, Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS, SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Cites Work
- Bin packing can be solved within 1+epsilon in linear time
- Integer Programming with a Fixed Number of Variables
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Unnamed Item
