Research output

1. An exact solution with an improved running time for the routing flow shop problem with two machines

   Research output: Contribution to journal › Article › peer-review

2. An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements

   Research output: Contribution to journal › Article › peer-review

3. A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types

   Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

View all (19) »