Models and complexity of multibin packing problems
type: Item
instance of: scholarly article
title: Models and complexity of multibin packing problems
zbMATH Open document ID: 1156.90432
author: Gerd Finke
author: Pierre Lemaire
author: Nadia Brauner
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2007-02-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5125338
MaRDI profile type: Publication
full work available at URL: s10852-005-9025-y
OpenAlex ID: W2025093995
cites work: Q4258216
cites work: Mutual exclusion scheduling
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Q4380372
cites work: Scheduling with incompatible jobs
cites work: Q4247460
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Complexity of Scheduling Parallel Task Systems
cites work: Q4198056
cites work: Q4875172
cites work: An approximation scheme for bin packing with conflicts
cites work: An exact algorithm for the dual bin packing problem
cites work: Upper bounds and algorithms for the maximum cardinality bin packing problem.
cites work: Q5702321
cites work: Matching theory
cites work: Scheduling with deadlines and loss functions
cites work: An efficient algorithm for the ring loading problem with integer demand splitting
cites work: The Ring Loading Problem
DOI: 10.1007/S10852-005-9025-Y
description: scientific article; zbMATH DE number 5125338