The multifit algorithm for set partitioning containing kernels
From MaRDI portal
Publication:1807874
DOI10.1007/S11766-999-0029-7zbMath0951.90020OpenAlexW2315854027MaRDI QIDQ1807874
Publication date: 23 November 1999
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-999-0029-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
- Three-partitioning containing kernels: Complexity and heuristic
- An Application of Bin-Packing to Multiprocessor Scheduling
This page was built for publication: The multifit algorithm for set partitioning containing kernels