12 citations · 22 across the 7 of their papers we have counts for
7 papers
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
Alessandro Druetto, Andrea Grosso, Jully Jeunet +1
We consider the problem of scheduling non preemptively a set of jobs on parallel identical machines with prior setup operations on a single shared server, where the objective is to…
Single machine rescheduling for new orders: properties and complexity results
Elena Rener, Fabio Salassa, Vincent T'kindt
Rescheduling problems arise in a variety of situations where a previously planned schedule needs to be adjusted to deal with unforeseen events. A common problem is the arrival of n…
A solution procedure for minimizing total completion time in a parallel-batching environment
Arianna Alfieri, Alessandro Druetto, Andrea Grosso +1
In many manufacturing processes, batch processing is frequently needed for capacity reasons. This applies both to parallel and serial batching. However, while the serial batch proc…
A solution to a Partitioned Balanced Tournament Design of side 11
Federico Della Croce, Gabriele Dragotto, Fabio Salassa
We provide a solution to the Partitioned Balanced Tournament Design of side . The solution has been generated by exploiting combinatorial optimization methods.
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
Fabio Salassa, Gabriele Dragotto, Tommaso Traetta +2
The Oberwolfach Problem -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph decomposes into edge-di…
MILP and Max-Clique based heuristics for the Eternity II puzzle
Fabio Salassa, Wim Vancroonenburg, Tony Wauters +2
The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer…
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa +1
In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate wi…