2 citations · 3 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2023
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…
cs.DM2017
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…