Author of the publication

Online algorithms for the multiple time series search problem.

, , , and . Comput. Oper. Res., 39 (5): 929-938 (2012)

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.

 

Other publications of authors with the same name

How much can lookahead help in online single machine scheduling., , and . Inf. Process. Lett., 106 (2): 70-74 (2008)Robust disassembly line balancing with ambiguous task processing times., , , , and . Int. J. Prod. Res., 58 (19): 5806-5835 (2020)A Mathematical Model for Bus Scheduling with Conditional Signal Priority., , , , and . APMS (3), volume 632 of IFIP Advances in Information and Communication Technology, page 274-281. Springer, (2021)Charging Scheduling Optimization of Battery Electric Bus with Controllable Task Completion., , , and . APMS (3), volume 632 of IFIP Advances in Information and Communication Technology, page 282-289. Springer, (2021)Electric Bus Charging Scheduling Strategy with Stochastic Arrival Time and State of Charge., , , , and . APMS (3), volume 632 of IFIP Advances in Information and Communication Technology, page 241-249. Springer, (2021)Multitasking Scheduling Problem with Uncertain Credit Risk., , , and . APMS (3), volume 632 of IFIP Advances in Information and Communication Technology, page 266-273. Springer, (2021)Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries., and . COCOA, volume 8287 of Lecture Notes in Computer Science, page 72-83. Springer, (2013)On Job Scheduling with Preemption Penalties., , and . AAIM, volume 5564 of Lecture Notes in Computer Science, page 315-325. Springer, (2009)A tight lower bound for job scheduling with cancellation., , , , and . Inf. Process. Lett., 97 (1): 1-3 (2006)Hitting a Set of Line Segments with One or Two Discrete Centers., , , , , and . CCCG, page 85-90. (2018)