( en | de | ru )

 

Disambiguation of "Hoogeveen, Han"

Author of the publication

copydeleteadd this publication to your clipboard
Non-approximability Results for Scheduling Problems with Minsum Criteria.

, , and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 353-366. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Muxin Han

Luyang Han

Mei Han

Bing Han

Johannes Han

 

Other publications of authors with the same name

Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search., , and . SEA, volume 7933 of Lecture Notes in Computer Science, page 402-413. Springer, (2013)The two-machine open shop problem: To fit or not to fit, that is the question., , and . Oper. Res. Lett., 31 (3): 219-224 (2003)Optimal On-Line Algorithms for Single-Machine Scheduling., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 404-414. Springer, (1996)Earliness-Tardiness Scheduling Around Almost Equal Due Dates., and . INFORMS J. Comput., 9 (1): 92-99 (1997)Non-approximability Results for Scheduling Problems with Minsum Criteria., , and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 353-366. Springer, (1998)Separating a walkable environment into layers., , , and . MIG, page 101-106. ACM, (2016)Path Planning for Groups Using Column Generation., , , and . MIG, volume 6459 of Lecture Notes in Computer Science, page 94-105. Springer, (2010)Scheduling with step-improving processing times., , , , and . Oper. Res. Lett., 34 (1): 37-40 (2006)Scheduling Electric Buses with Stochastic Driving Times., , , and . ATMOS, volume 115 of OASIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)How to Measure the Robustness of Shunting Plans., , and . ATMOS, volume 65 of OASIcs, page 3:1-3:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)