Generalized Assignment with Nonlinear Capacity Interaction

DOI10.1287/mnsc.35.8.923zbMath0675.90057OpenAlexW2088884185MaRDI QIDQ3830817

Joseph B. Mazzola

Publication date: 1989

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.35.8.923

zbMATH Keywords

branch-and-bound algorithmapproximate solutionsgeneralized assignment problemresource allocationheuristicbounding techniqueshierarchical production planningnonlinear 0-1 programmingnear-optimal solutionsnonlinear capacity constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Boolean programming (90C09)

Related Items

Reducing multivalued discrete variables in solving separable task assignment problems, Heuristics for the multi-resource generalized assignment problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Lower and upper bounds for the non-linear generalized assignment problem, A Survey of the Generalized Assignment Problem and Its Applications, Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand, Effective algorithm and heuristic for the generalized assignment problem., A survey of algorithms for the generalized assignment problem, An algorithm for the bottleneck generalized assignment problem, Time-cost Trade-off Relations in Bulk Transportation Problem, Combinatorial optimization models for production scheduling in automated manufacturing systems, Multiproduct production planning in the presence of work-force learning