A Probabilistic Analysis of Two-Machine Flowshops
From MaRDI portal
Publication:4346342
Recommendations
- Probabilistic Analysis of a Machine Scheduling Problem
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Two-machine ordered flowshop scheduling under random breakdowns
- Two-machine stochastic flow shops with blocking and the traveling salesman problem
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
- Stochastically minimizing the makespan in two-machine flow shops without blocking
Cited in
(9)- Performance guarantees for flowshop heuristics to minimize makespan
- Scheduling and due-date quotation in a make-to-order supply chain
- Probabilistic Analysis of a Machine Scheduling Problem
- A Fluid Heuristic for Minimizing Makespan in Job Shops
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Two-machine stochastic flow shops with blocking and the traveling salesman problem
- An empirical analysis of the optimality rate of flow shop heuristics
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
This page was built for publication: A Probabilistic Analysis of Two-Machine Flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346342)
