Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

<div>Schedule generated to obtain the maximum value of waiting time <svg height="12.3115pt" id="M160" style="vertical-align:-3.31355pt" version="1.1" viewbox="-0.0498162 -8.99795 17.7257 12.3115" width="17.7257pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M962 650H739L732 622L760 619C812 613 819 604 798 552C760 457 671 267 606 131H604L511 638H480L237 131H233L183 554C177 607 183 614 226 619L248 622L257 650H24L17 622C88 615 92 611 103 524L173 -11H203L450 491H453L543 -11H575L839 529C882 609 886 613 953 622L962 650Z" id="g113-88"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="974" vert-adv-y="974"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,11.232,3.264)"><path d="M606 650H137L129 618C217 609 221 609 203 518L129 129C115 46 106 40 26 32L18 0H300L307 32C210 40 203 45 218 129L249 305H358C454 305 455 296 457 219H491L531 425H497C465 353 463 350 366 350H259L300 569C306 605 310 611 346 611H444C522 611 535 598 541 578C550 557 553 519 552 485L588 489L606 650Z" id="g50-71"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="630" vert-adv-y="630"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem 