Packing chained items in aligned bins with applications to container transshipment and project scheduling
From MaRDI portal
Publication:1935930
DOI10.1007/s00186-012-0386-5zbMath1258.49065OpenAlexW1982100514MaRDI QIDQ1935930
Publication date: 20 February 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-012-0386-5
Applications of optimal control and differential games (49N90) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items (4)
Vehicle scheduling under the warehouse-on-wheels policy ⋮ A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints ⋮ Survey of quantitative methods in construction ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
Cites Work
- Unnamed Item
- How to park freight trains on rail-rail transshipment yards: the train location problem
- A survey of variants and extensions of the resource-constrained project scheduling problem
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Determining crane areas in intermodal transshipment yards: the yard partition problem
- Project Scheduling Under Partially Renewable Resource Constraints
- A new approach to the maximum-flow problem
- Efficient algorithms for interval graphs and circular-arc graphs
This page was built for publication: Packing chained items in aligned bins with applications to container transshipment and project scheduling