Judith-Madeleine Kubitza

  • Citations Per Year
Learn More
We study the complexity of scheduling non-preemptive jobs of two given agents on one machine, while respecting the upper-bounds on the weighted sum of completion times which are given individually for each agent. Since the problem is known to be hard even for quite restrictive variants, we focus on the case where one agent has significantly smaller number(More)
Scheduling theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attention of the community. Our aim is to bring these two areas closer together by studying the parameterized complexity of a class of single-machine two-agent scheduling problems. Our(More)
  • 1