Performance Guarantees for Scheduling Algorithms
From MaRDI portal
Cited in
(20)- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
- Worst case performance for lot sizing heuristics
- An algorithm for flow time minimization and its asymptotic makespan properties
- A heuristic for preemptive scheduling with set-up times
- Rate-monotonic scheduling for hard-real-time systems
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- Heuristics for parallel machine scheduling with delivery times
- Scheduling with incompatible jobs
- Parallel machine scheduling with splitting jobs
- Performance enhancements to tabu search for the early/tardy scheduling problem
- Heuristic methods and applications: A categorized survey
- Heuristics for scheduling unrelated parallel machines
- NP-Complete operations research problems and approximation algorithms
- A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS
- Performance of the LPT algorithm in multiprocessor scheduling
- Lower bounds for online scheduling on four processors
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
This page was built for publication: Performance Guarantees for Scheduling Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147833)
