The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
From MaRDI portal
Publication:2030576
DOI10.1016/j.ejor.2020.10.029zbMath1487.90330OpenAlexW3097236980MaRDI QIDQ2030576
Farook Hamzeh, Bacel Maddah, Hussein Tarhini
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.10.029
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Uses Software
Cites Work
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Are stacker crane problems easy? A statistical study
- A tabu search heuristic for the quay crane scheduling problem
- Variable neighborhood search for minimum cost berth allocation
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- A generalized classification scheme for crane scheduling with interference
- A crane scheduling method for port container terminals
- Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- Julia: A Fresh Approach to Numerical Computing
- Partial linear characterizations of the asymmetric travelling salesman polytope
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Vehicle Routing Problem with Time Windows
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
