Background: Container terminals (CTs) have constantly administered truck appointment systems (TASs) to effectively accomplish the planning and scheduling of drayage operations. However, since the operations in the gate and yard area of a CT are stochastic, there is a need to incorporate...

This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and...

This handbook covers not only in a unified approach the most important scheduling models and methods, it also put special emphasis to their relevance to practical situations. Many applications from industry and service operations management and case studies are described. Because the book offers...

The All-pairs shortest path problem (ALL-SPP) aims to find the shortest path joining all the vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL-SPP (DM-ALL-SPP) to solve the ALL-SPP based on column-row navigation through the adjacency matrix. DM-ALL-SPP is...