A generalized combination of parallel machine scheduling and path
From MaRDI portal
Cites work
- A combination of flow shop scheduling and the shortest path problem
- A combination of parallel machine scheduling and the covering problem
- A note on two problems in connexion with graphs
- A simple efficient approximation scheme for the restricted shortest path problem
- A study on several combination problems of classic shop scheduling and shortest path
- An Application of Bin-Packing to Multiprocessor Scheduling
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- An improved FPTAS for Restricted Shortest Path.
- Approximation Schemes for the Restricted Shortest Path Problem
- Bounds on Multiprocessing Timing Anomalies
- Closing the gap for makespan scheduling via sparsification techniques
- Combination of parallel machine scheduling and vertex cover
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
- On the exact upper bound for the Multifit processor scheduling algorithm
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
This page was built for publication: A generalized combination of parallel machine scheduling and path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968703)
