Reallocation problems with minimum completion time

DOI10.1007/S00453-025-01320-0MaRDI QIDQ6936583zbMATH OpenFDO

Authors Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono

Publication date 29 August 2025

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-025-01320-0

zbMATH Keywords

algorithmapproximationbin packingcapacity augmentationNP-hardnessscheduling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35)

Cites work

• An approximation algorithm for the generalized assignment problem
• Coupled and \(k\)-sided placements: generalizing generalized assignment
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 563208 (Why is no real title available?)
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Settlement fund circulation problem
• The dial-a-ride problem: Models and algorithms
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936583)