A N-N optimization model for logistic resources allocation with multiple logistic tasks under demand uncertainty
type: Item
instance of: scholarly article
title: A N-N optimization model for logistic resources allocation with multiple logistic tasks under demand uncertainty
zbMATH Open document ID: 1402.90021
author: Y. Aharonov
published in: Soft Computing
publication date: 2018-11-27T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6985161
zbMATH Keywords: task-resource assignment
zbMATH Keywords: demand uncertainty
zbMATH Keywords: task scheduling
zbMATH Keywords: resource leveling
MaRDI profile type: Publication
full work available at URL: s00500-018-3434-0
OpenAlex ID: W2885943318
cites work: A cardinality constrained stochastic goal programming model with satisfaction functions for venture capital investment decision making
cites work: Fuzzy multi-period portfolio selection with different investment horizons
cites work: Determining the fuzzy measures in multiple criteria decision aiding from the tolerance perspective
cites work: Depedent-chance programming: A class of stochastic optimization
cites work: Novel multi-objective resource allocation and activity scheduling for fourth party logistics
cites work: Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
cites work: A new hybrid genetic algorithm for job shop scheduling problem
cites work: A stochastic programming approach for supply chain network design under uncertainty
cites work: Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation
cites work: A bi-level programming model of resource matching for collaborative logistics network in supply uncertainty environment
cites work: A dynamic logistics coordination model for evacuation and support in disaster response activities
cites work: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
Wikidata QID: Q129433282
DOI: 10.1007/S00500-018-3434-0
description: scientific article; zbMATH DE number 6985161