Optimization of crane setup location and servicing schedule for urgent material requests with non-homogeneous and non-fixed material supply

Reducing hook movement distances could decrease crane operation times to deliver heavyweight materials in construction sites. Conventional scheduling methods include first-in-first-serve (FIFS), shortest-job-first (SJF), nearest-neighbor-first (NNF), and Traveling salesman problem (TSP). A new optimization model to optimize crane setup location, hook movement sequences and servicing schedules serving all supply and demand locations is proposed. Proposed model is able to model homogeneous and non-homogeneous material supply. Initial hook location can be given as input for optimization. Fixed material supply and demand location pairs are relaxed as model variables. Maximum crane lifting capacity is considered and multiple hook movement trips between material supply and demand locations are modeled if requested material weights exceed this maximum crane lifting capacity. Users may place "urgent" material demand requests and the proposed optimization model can optimize a servicing sequence to prioritize all urgent requests. The problem is formulated as a Binary-Mixed Integer-Linear-Program (BMILP) which is solved by standard branch-and-bound techniques. Significant reduction in total operation time is achieved while comparing to other conventional scheduling strategies.