Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
From MaRDI portal
Publication:6572832
DOI10.1016/j.ejor.2024.03.027MaRDI QIDQ6572832
Kyungsik Lee, Jinil Han, Jongyoon Park
Publication date: 16 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
assignmentinteger optimizationbranch-and-price-based heuristicmulti-period resource allocationnon-shareable resource
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Determining the \(K\)-best solutions of knapsack problems
- Caching is hard -- even in the fault model
- On practical resource allocation for production planning and scheduling with period overlapping setups
- An effective genetic algorithm approach to multiobjective resource allocation problems (MORAPs)
- Resource-constrained project scheduling: Notation, classification, models, and methods
- An iterative dynamic programming approach for the temporal knapsack problem
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Project selection, scheduling and resource allocation with time dependent returns
- Parallel Machine Scheduling by Column Generation
- A quasi-PTAS for unsplittable flow on line graphs
- Resource Allocation for Covering Time Varying Demands
- A Linear Programming Approach to the Cutting-Stock Problem
- Reformulation and Decomposition of Integer Programs
- Symmetry in Integer Linear Programming
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Resource allocation problem under single resource assignment
- To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack
- Improved Algorithm for Resource Allocation Problems
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- New Approximation Schemes for Unsplittable Flow on a Path
- The Temporal Knapsack Problem and Its Solution
- A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
- Scheduling projects with labor constraints
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
This page was built for publication: Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem