Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The multifit algorithm for set partitioning containing kernels

From MaRDI portal
Publication:1807874
Jump to:navigation, search

DOI10.1007/S11766-999-0029-7zbMath0951.90020OpenAlexW2315854027MaRDI QIDQ1807874

Yong He

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


zbMATH Keywords

machine schedulingset partitioningnonsimultaneous machine release times


Mathematics Subject Classification ID

Combinatorics on words (68R15) Deterministic scheduling theory in operations research (90B35)


Related Items (1)

Exact performance of MULTIFIT for nonsimultaneous machines




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1807874&oldid=14169723"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 09:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki