Approximability of scheduling with fixed jobs

DOI10.1002/(SICI)1099-1425(199911/12)2:6%3C267::AID-JOS31%3E3.0.CO;2-HzbMATH Open0953.90025MaRDI QIDQ1964484FDOQ1964484

Authors: Mark Scharbrodt, Angelika Steger, Horst Weisser

Publication date: 1 February 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

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

scheduling makespan polynomial approximation scheme

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

Title not available (Why is that?)
Bin packing can be solved within 1+epsilon in linear time
Integer Programming with a Fixed Number of Variables
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
Bounds for Certain Multiprocessing Anomalies
An Application of Bin-Packing to Multiprocessor Scheduling
Tighter Bounds for the Multifit Processor Scheduling Algorithm

Cited In (31)

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
Fixed-order scheduling on parallel machines
Scheduling on same-speed processors with at most one downtime on each machine
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
Multi-agent scheduling on a single machine with max-form criteria
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
Scheduling and fixed-parameter tractability
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Approximation schemes for parallel machine scheduling with availability constraints
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
Title not available (Why is that?)
Title not available (Why is that?)
On the optimality of approximation schemes for the classical scheduling problem
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)