An iterated local search algorithm for a place scheduling problem

DOI10.1155/2013/659297zbMATH Open1299.90147OpenAlexW2132114842WikidataQ59031394 ScholiaQ59031394MaRDI QIDQ474475FDOQ474475

Authors Shicheng Hu, Zhaoze Zhang, Qingsong He, Xuedong Sun 

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Hybrid algorithm for project scheduling with capacity constraint
• scientific article; zbMATH DE number 370525
• A branch and bound algorithm for project scheduling problem with spatial resource constraints
• scientific article; zbMATH DE number 1082109
• Solving the resource-constrained project scheduling problem by a variable neighbourhood search.

Cites Work

• scientific article; zbMATH DE number 1630027 (Why is no real title available?)
• scientific article; zbMATH DE number 1300399 (Why is no real title available?)
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A robust genetic algorithm for resource allocation in project scheduling
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Applying an extended guided local search to the quadratic assignment problem
• Extreme point-based heuristics for three-dimensional bin packing
• Fast local search algorithms for the handicapped persons transportation problem
• Guided local search and its application to the traveling salesman problem
• Guided local search as a network planning algorithm that incorporates uncertain traffic demands
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Local search algorithms for political districting
• Local search based heuristics for global optimization: atomic clusters and beyond
• Multi-directional local search
• PSPLIB -- a project scheduling problem library
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• The Three-Dimensional Bin Packing Problem

Cited In (3)

• Improving local search heuristics for some scheduling problems. II
• Improving local search heuristics for some scheduling problems. I
• An iterated local search for solving a location-routing problem

Uses Software

• PSPLIB

This page was built for publication: An iterated local search algorithm for a place scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474475)