Pages that link to "Item:Q4147833"
From MaRDI portal
The following pages link to Performance Guarantees for Scheduling Algorithms (Q4147833):
Displaying 19 items.
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems (Q751515) (← links)
- On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints (Q909452) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs (Q1152708) (← links)
- Worst case performance for lot sizing heuristics (Q1160558) (← links)
- An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
- A heuristic for preemptive scheduling with set-up times (Q1202243) (← links)
- Rate-monotonic scheduling for hard-real-time systems (Q1278515) (← links)
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
- Heuristics for parallel machine scheduling with delivery times (Q1338896) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- Parallel machine scheduling with splitting jobs (Q1570839) (← links)
- Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Heuristics for scheduling unrelated parallel machines (Q2276868) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS (Q4820116) (← links)
