1 citations · 1 across the 2 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2021
Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
Fan Yang, Morteza Davari, Wenchao Wei +2
We study the scheduling of jobs on a single parallel-batching machine with non-identical job sizes and incompatible job families. Jobs from the same family have the same processing…
math.OC2021
Exact algorithms for budgeted prize-collecting covering subgraph problems
Nicola Morandi, Roel Leus, Hande Yaman
We introduce a class of budgeted prize-collecting covering subgraph problems. For an input graph with prizes on the vertices and costs on the edges, the aim of these problems is to…