This research effort presents a tabu search algorithm to solve the dynamic airlift loading problem. Given a set of palletized cargo items which require transportation from an aerial port of embarkation to an aerial port of debarkation within a pre-specified time frame, the dynamic airlift...

Written by an experienced operations research practitioner with a strong applied mathematics background, this book offers practical insights into how to approach optimization problems, how to develop intelligent and efficient mathematical models and algorithms, and how to implement and deliver...

In distribution systems such as airlines and express package delivery, the use of hub-and-spoke networks is common, and flow consolidation at hub facilities is essential for cost reduction. While a constant discount factor is typically used to model cost reduction in interhub links, this paper...

We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...