Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
type: Item
instance of: scholarly article
title: Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
author: Michael Dienstknecht
author: Dirk Briskorn
published in: European Journal of Operational Research
publication date: 2024-06-13T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7864406
zbMATH Keywords: scheduling
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: packing
zbMATH Keywords: sharing economy
zbMATH Keywords: construction industry
MaRDI profile type: Publication
cites work: Optimization for dynamic ride-sharing: a review
cites work: Multi-level departments-to-offices assignment with different room types
cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
cites work: Algorithmic aspects of bandwidth trading
cites work: Introduction to Stochastic Programming
cites work: Constraints in container loading -- a state-of-the-art review
cites work: Matching supply and demand in a sharing economy: classification, computational complexity, and application
cites work: Q3145800
cites work: When Is the Classroom Assignment Problem Hard?
cites work: Q4449841
cites work: Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
cites work: On the complexity of adjacent resource scheduling
cites work: Heuristics for container loading of furniture
cites work: Timetabling problem for university as assignment of activities to resources
cites work: A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
cites work: Q4198056
cites work: Approximation algorithms for dynamic storage allocation
cites work: Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
cites work: A rolling-horizon approach for multi-period optimization
cites work: A polynomial time approximation algorithm for dynamic storage allocation
cites work: Interval scheduling: A survey
cites work: A critical-shaking neighborhood search for the yard allocation problem
cites work: A survey for the quadratic assignment problem
cites work: Stochastic Optimization Methods
cites work: Flexible bandwidth assignment with application to optical networks
cites work: A genetic algorithm based heuristic for adjacent paper-reel layout problem
DOI: 10.1016/J.EJOR.2023.11.045
description: scientific article; zbMATH DE number 7864406