Search results

From MaRDI portal
  • completion times on parallel machines 2016-09-29 Paper PolySCIP 2016-09-28 Paper Robust polynomial-time approximation schemes for parallel machine scheduling...
    10 bytes (15 words) - 17:39, 6 October 2023
  • Hamming approximation of NP witnesses 2014-10-06 Paper Polynomial-time approximation scheme for data broadcast 2014-09-26 Paper Distributed and parallel algorithms...
    10 bytes (16 words) - 15:51, 10 December 2023
  • 2019-05-14 Paper A parallel immersed boundary method for blood-like suspension flow simulations 2018-10-26 Paper Performance analysis of the parallel Aitken-additive...
    10 bytes (13 words) - 03:37, 9 December 2023
  • Publication Type Online early work scheduling on parallel machines 2024-08-13 Paper An improved approximation algorithm for a scheduling problem with transporter...
    10 bytes (15 words) - 12:32, 9 December 2023
  • Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques 2024-03-15 Paper An FPTAS for scheduling with resource...
    10 bytes (16 words) - 17:03, 8 December 2023
  • 2017-10-23 Paper Approximation algorithms for two-machine flow shop scheduling with an outsourcing option 2017-07-14 Paper Approximation algorithms of quay...
    10 bytes (14 words) - 00:36, 11 December 2023
  • Paper A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. 2002-01-30 Paper Two-machine no-wait flow shop scheduling...
    10 bytes (15 words) - 11:24, 8 December 2023
  • approximate max-flow min-cut relation for undirected multicommodity flow, with applications 1996-04-16 Paper A Nearly Best-Possible Approximation Algorithm for...
    10 bytes (16 words) - 06:06, 13 December 2023
  • model for the turbulent channel flow 2025-01-24 Paper A Time-Relaxation Reduced Order Model for the Turbulent Channel Flow 2023-12-20 Paper Optimal Chebyshev...
    10 bytes (14 words) - 10:21, 8 December 2023
  • single product on unrelated parallel machines 2020-04-27 Paper Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining...
    10 bytes (17 words) - 16:59, 9 December 2023
  • Function approximation on triangular grids: Some numerical results using adaptive techniques 2000-04-27 Paper Parallel computation for shallow water flow: A...
    10 bytes (14 words) - 15:21, 8 December 2023
  • Preemptive Parallel Machine Scheduling 2009-08-18 Paper Complete Complexity Classification of Short Shop Scheduling 2009-08-18 Paper Approximation and Online...
    10 bytes (14 words) - 15:02, 10 December 2023
  • 1994-05-15 Paper Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops 1993-05-16 Paper Minimizing Mean Flow Time With Release Time and Deadline...
    10 bytes (17 words) - 07:34, 9 December 2023
  • problem 1991-01-01 Paper Efficient parallel algorithms for series parallel graphs 1991-01-01 Paper Efficient parallel and sequential algorithms for 4-coloring...
    10 bytes (13 words) - 19:41, 9 December 2023
  • polynomial time approximation scheme to maximize early work on parallel machines with common due date 2020-02-25 Paper Scheduling on parallel identical machines...
    10 bytes (15 words) - 14:11, 12 December 2023
  • 2021-01-27 Paper Network Flow-Based Refinement for Multilevel Hypergraph Partitioning 2020-12-16 Paper Load-Balancing for Parallel Delaunay Triangulations...
    10 bytes (15 words) - 17:35, 8 December 2023
  • 2021-10-19 Paper New approximation algorithms for machine scheduling with rejection on single and parallel machine 2021-05-10 Paper Approximation algorithms for...
    10 bytes (13 words) - 20:46, 9 December 2023
  • multi-commodity flow trees 2023-01-18 Paper Facility location with dynamic distance functions 2022-12-09 Paper LP-based approximation for uniform capacitated...
    10 bytes (15 words) - 01:34, 9 December 2023
  • tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling 2022-08-26 Paper Approximation algorithms for two parallel dedicated machine...
    10 bytes (13 words) - 17:01, 6 October 2023
  • Rejecting jobs to minimize load and maximum flow-time 2017-10-11 Paper New approximation schemes for unsplittable flow on a path 2017-10-05 Paper Rejecting jobs...
    10 bytes (16 words) - 16:05, 10 December 2023