Matching supply and demand in a sharing economy: classification, computational complexity, and application
From MaRDI portal
Publication:1999391
DOI10.1016/j.ejor.2019.04.032zbMath1430.90064WikidataQ127985280 ScholiaQ127985280MaRDI QIDQ1999391
Stefan Schwerdfeger, Nils Boysen, Dirk Briskorn
Publication date: 26 June 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.032
90C90: Applications of mathematical programming
90C60: Abstract computational complexity for mathematical programming problems
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
91B42: Consumer behavior, demand theory
Related Items
Evaluation performance of time series methods in demand forecasting: Box-Jenkins vs artificial neural network (Case study: Automotive Parts industry), Online stochastic weighted matching algorithm for real‐time shared parking, Matching supply and demand for free-floating car sharing: on the value of optimization, A multi-period analysis of the integrated item-sharing and crowdshipping problem, Bilateral value-added service investment in platform competition with cross-side network effects under multihoming, Who will pay for the ``bicycle cemetery? Evolutionary game analysis of recycling abandoned shared bicycles under dynamic reward and punishment, Matching functions for free-floating shared mobility system optimization to capture maximum walking distances, Two-sided matching and strategic selection on freight resource sharing platforms, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, Ride solo or pool: designing price-service menus for a ride-sharing platform
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Increasing the revenue of self-storage warehouses by optimizing order scheduling
- Interval scheduling on related machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Scheduling jobs with fixed start and end times
- On the computational complexity of (maximum) class scheduling
- Robust discrete optimization and its applications
- Scheduling equal-length jobs on identical parallel machines
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A typology of cutting and packing problems
- Executing production schedules in the face of uncertainties: a review and some future directions
- Optimization for dynamic ride-sharing: a review
- A classification of assembly line balancing problems
- Kidney Exchange
- Interval scheduling: A survey
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Hamilton Paths in Grid Graphs
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- College Admissions and the Stability of Marriage
