Timetabling scheduling is classified as a combinatorial problem for which there are multiple solution alternatives, including the integer programming. However, the modeling of operational rules and the size of real problems makes its use not common compared to other techniques. This article...

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matching exists in a discrete matching market when firms' preference profile satisfies a...

This work proposes a variation of the location-routing problem (LRP), a problem that interconnects two well-known N P-hard optimisation problems: the vehicle routing problem (VRP) and facility location problem (FLP). There are many mathematical formulations and solution methods for a number of...

The Facility Layout Problem (FLP) is a classic problem for industrial engineers and work area designers, taking relevance because of its direct impact on productivity and efficiency in the productive systems. On the other hand, we face the Unequal Area Facility Layout Problem (UA-FLP) when the...

This study addresses the electric vehicle routing problem with time windows and simultaneous pickup and deliveries in the context of sustainable city logistics. Time windows and simultaneous pickup and delivery constraints are two important real-life constraints to effectively organize freight...