Solution techniques for a crane sequencing problem

No abstract is available for this paper.

• Publication year

  2009

• Venue

  International Journal of Mathematics in Operational Research (IJMOR)

• Publication date

  2009-06-08

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1504/IJMOR.2009.026276
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Simulated Annealing

  2008cited by this paper
• Tabu Search Heuristics for the Crane Sequencing Problem

  2008cited by this paper
• Experimental investigation of heuristics for resource-constrained project scheduling: An update

  2006cited by this paper
• A SIMULATED ANNEALING HEURISTIC FOR A CRANE SEQUENCING PROBLEM

  2006cited by this paper
• Hybrid ant systems for the dynamic facility layout problem

  2006influential reference
• Simulated annealing heuristics for managing resources during planned outages at electric power plants

  2005cited by this paper
• Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

  2004cited by this paper
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version

  2003cited by this paper
• The single‐vehicle routing problem with unrestricted backhauls

  2003cited by this paper
• Efficient feasibility testing for dial-a-ride problems

  2002cited by this paper
• Crane scheduling using tabu search

  2002cited by this paper
• Ant colonies for the quadratic assignment problem

  1999cited by this paper
• ACO algorithms for the quadratic assignment problem

  1999cited by this paper
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries

  1999cited by this paper
• Approximating Capacitated Routing and Delivery Problems

  1999cited by this paper
• The Swapping Problem on a Line

  1999cited by this paper
• The Ant System Applied to the Quadratic Assignment Problem

  1999cited by this paper
• Algorithms for capacitated vehicle routing

  1998cited by this paper
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

  1998cited by this paper
• TABU SEARCH METHODS FOR THE FLOW SHOP SEQUENCING PROBLEM

  1997cited by this paper
• Ant colony system: a cooperative learning approach to the traveling salesman problem

  1997influential reference
• The Ant System: Optimization by a colony of cooperating agents

  1996cited by this paper
• The Travelling Salesman Problem with pick-up and delivery

  1994cited by this paper
• The traveling salesman problem: An overview of exact and approximate algorithms

  1992cited by this paper
• Preemptive Ensemble Motion Planning on a Tree

  1992cited by this paper
• Solution of large-scale symmetric travelling salesman problems

  1991cited by this paper
• The Rearrangement of Items in a Warehouse

  1973cited by this paper
• ON THE TRUCK DISPATCHING PROBLEM

  1971cited by this paper

• An integrated storage space and berth allocation problem in a container terminal

  2010cites this paper