Contatto di riferimento: Alberto Santini
Il seminario sarà anche trasmesso in streaming al seguente indirizzo:
https://webconference.unibo.it/or-seminar
Abstract
Supply chain optimization involves a joint resolution of scheduling and routing problems. In such problem, the routing problem resolution should required dedicated algorithm to tackle simultaneously several constraints and objective including minimization of makespan, riding time, time spent in buffer, etc....
Researchers in machine scheduling area have addressed problems involving both scheduling and routing, such as, for example the job-shop with transport where the movement of tasks between different machines is not instantaneous. However, in scheduling with transport it is commonly used a graph-based modeling approach in which there is no explicit representation of the transport and, as a consequence, no algorithm of the routing community is used.
We describe a first step into a cooperative heuristic solution approach for scheduling with transportation allows generating adjusted timing constraints through an exchange of information between two alternating stages. The first one models the scheduling and the second the routing where the scheduling constraints (earliest starting time...) are transformed into constraints for the routing.