An integrated approach for allocation and scheduling-location problems on graphs

DOI10.1007/S40314-024-02650-5MaRDI QIDQ6543758zbMATH OpenFDO

Authors Kien Trung Nguyen, Huy Minh Le

Publication date 25 May 2024

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-024-02650-5

zbMATH Keywords

knapsack problemlocationmakespannonrenewable allocationschedulingsingle machine

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2242479
• Integrated scheduling and location models: single machine makespan problems
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Solving scheduling and location problems in the plane simultaneously
• scientific article; zbMATH DE number 4072697

Cites work

• 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
• An Algorithm for Large Zero-One Knapsack Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
• scientific article; zbMATH DE number 4095196 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 2242479 (Why is no real title available?)
• Integrated scheduling and location models: single machine makespan problems
• Inverse anti-k-centrum problem on networks with variable edge lengths
• Menu Auctions, Resource Allocation, and Economic Influence
• Optimal adjustment of competence set with linear programming
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Robust absolute single machine makespan scheduling-location problem on trees
• Robust estimation: location-scale and regression problems
• Scheduling algorithms
• Scheduling of Project Networks by Job Assignment
• Solving scheduling and location problems in the plane simultaneously

This page was built for publication: An integrated approach for allocation and scheduling-location problems on graphs

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