Applying Johnson's rule in scheduling multiple parallel two-stage flowshops
From MaRDI portal
(Redirected from Publication:6535816)
Recommendations
- On scheduling multiple parallel two-stage flowshops with Johnson's rule
- On scheduling multiple two-stage flowshops
- Approximation algorithms for the parallel flow shop problem
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
- Approximation algorithms for scheduling multiple two-stage flowshops
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- An FPTAS for the parallel two-stage flowshop problem
- Approximation algorithms for the parallel flow shop problem
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 736667 (Why is no real title available?)
- On scheduling inclined jobs on multiple two-stage flowshops
- On scheduling multiple two-stage flowshops
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling multiple two-stage flowshops with a deadline
- Scheduling two-stage jobs on multiple flowshops
This page was built for publication: Applying Johnson's rule in scheduling multiple parallel two-stage flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535816)