Probabilistic Analysis of a Machine Scheduling Problem
From MaRDI portal
Publication:3680595
Recommendations
Cited in
(12)- Probabilistic single processor scheduling
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- scientific article; zbMATH DE number 947476 (Why is no real title available?)
- scientific article; zbMATH DE number 5521829 (Why is no real title available?)
- Randomized mechanism design for decentralized network scheduling
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- New directions in scheduling theory
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- A Probabilistic Analysis of Two-Machine Flowshops
- Processor Reordering Rules
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
This page was built for publication: Probabilistic Analysis of a Machine Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680595)