Analysis of heuristics for vector scheduling and vector bin packing

Fundamental problems in operational research are vector scheduling and vector bin packing where a set of vectors or items must be packed into a fixed set of bins or a minimum number of bins such that, in each bin, the sum of the vectors does not exceed the bin’s vector capacity. They have many appli...

Full description

Saved in:
Bibliographic Details
Main Authors: Lars Nagel, Nikolay Popov, Tim Süß, Ze Wang
Format: Default Conference proceeding
Published: 2023
Subjects:
vector scheduling
vector bin packing
heuristics
local search
Online Access:https://hdl.handle.net/2134/24533194.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/24533194.v1

Similar Items