An iterated local search algorithm for a place scheduling problem
From MaRDI portal
Publication:474475
DOI10.1155/2013/659297zbMath1299.90147OpenAlexW2132114842WikidataQ59031394 ScholiaQ59031394MaRDI QIDQ474475
Zhaoze Zhang, Qingsong He, Xuedong Sun, Shicheng Hu
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/659297
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-directional local search
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- PSPLIB -- a project scheduling problem library
- Guided local search and its application to the traveling salesman problem
- Applying an extended guided local search to the quadratic assignment problem
- Local search based heuristics for global optimization: atomic clusters and beyond
- Guided local search as a network planning algorithm that incorporates uncertain traffic demands
- Local search algorithms for political districting
- Fast local search algorithms for the handicapped persons transportation problem
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- The Three-Dimensional Bin Packing Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A robust genetic algorithm for resource allocation in project scheduling
This page was built for publication: An iterated local search algorithm for a place scheduling problem
