In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...

We define the \emph{adjacent vertex distinguishing sum edge coloring problem}. This problem consists in finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not...

Many existing papers on the topic of smart grids work on scheduling of appliances considering an unlimited energy supply. However, the size of the power grid necessary to operate on periods of peak demand of the day would be large, and that would not be exploited during most of the day. Because...