Packing chained items in aligned bins with applications to container transshipment and project scheduling

DOI10.1007/s00186-012-0386-5zbMath1258.49065MaRDI QIDQ1935930

Malte Fliedner, Dirk Briskorn

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

zbMATH Keywords

optimization; project scheduling; bin packing; container yard; partially renewable resources

Mathematics Subject Classification ID

49N90: Applications of optimal control and differential games

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

90B05: Inventory, storage, reservoirs

Related Items

Vehicle scheduling under the warehouse-on-wheels policy, Survey of quantitative methods in construction, A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints, 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