Reallocation problems with minimum completion time

DOI10.1007/978-3-031-22105-7_26arXiv2111.02579MaRDI QIDQ6113854

Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.02579

zbMATH Keywords

algorithmschedulingapproximationNP-hardnessbin packingcapacity augmentation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Coupled and \(k\)-sided placements: generalizing generalized assignment
• An approximation algorithm for the generalized assignment problem
• Settlement fund circulation problem
• The dial-a-ride problem: Models and algorithms

This page was built for publication: Reallocation problems with minimum completion time