scientific article
From MaRDI portal
Publication:3929530
zbMath0473.90047MaRDI QIDQ3929530
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exact solutionbranch and boundmachinesenumerative algorithmcomputational comparisonsjobsheuristic preprocessingminimum-cost assignmentreduction phaseRoss-Soland's algorithm
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (41)
A parallel route building algorithm for the vehicle routing and scheduling problem with time windows ⋮ A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ A genetic algorithm for the generalised assignment problem ⋮ A simple dual algorithm for the generalised assignment problem ⋮ Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ The bottleneck generalized assignment problem ⋮ A note on exact algorithms for the bottleneck generalized assignment problem ⋮ Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Logic cuts for multilevel generalized assignment problems. ⋮ Environment-conscious scheduling of HPC applications on distributed cloud-oriented data centers ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ Improved Lagrangean decomposition: An application to the generalized assignment problem ⋮ Multivariate composite distributions for coefficients in synthetic optimization problems ⋮ On a class of assignment problems. ⋮ Minimization of makespan in generalized assignment problem. ⋮ Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem ⋮ A survey of algorithms for the generalized assignment problem ⋮ Implementing an insertion heuristic for vehicle routing on parallel hardware ⋮ A two-echelon stochastic facility location model for humanitarian relief logistics ⋮ The sector design and assignment problem for snow disposal operations ⋮ Greedy approaches for a class of nonlinear generalized assignment problems ⋮ A tabu search heuristic for the generalized assignment problem ⋮ Bees algorithm for generalized assignment problem ⋮ A family of inequalities for the generalized assignment polytope ⋮ The generalized assignment problem with flexible jobs ⋮ An algorithm for the bottleneck generalized assignment problem ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ A class of greedy algorithms for the generalized assignment problem ⋮ An exact method for the two-echelon, single-source, capacitated facility location problem ⋮ Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem ⋮ Efficient cuts in Lagrangean `relax-and-cut' schemes ⋮ A survey of models and algorithms for winter road maintenance. II: System design for snow disposal ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study ⋮ A path relinking approach with ejection chains for the generalized assignment problem ⋮ A multiplier adjustment technique for the capacitated concentrator location problem ⋮ A parametric analysis of heuristics for the vehicle routing problem with side-constraints ⋮ A set partitioning heuristic for the generalized assignment problem
This page was built for publication:
