scientific article; zbMATH DE number 1500536
From MaRDI portal
Publication:4501555
Recommendations
Cited in
(27)- A genetic algorithm for the proportionate multiprocessor open shop
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Approximation algorithms for the multiprocessor open shop scheduling problem
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Two-stage proportionate flexible flow shop to minimize the makespan
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Approximation schemes for scheduling and covering on unrelated machines
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- scientific article; zbMATH DE number 1670878 (Why is no real title available?)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
- A new three-machine shop scheduling: complexity and approximation algorithm
- A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- scientific article; zbMATH DE number 1396582 (Why is no real title available?)
- An FPTAS for the parallel two-stage flowshop problem
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- NP-hardness of compact scheduling in simplified open and flow shops.
- Linear time approximation scheme for the multiprocessor open shop problem
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
- An efficient polynomial-time approximation scheme for parallel multi-stage open shops
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501555)
