Author of the publication

Performance guarantees of jump neighborhoods on restricted related parallel machines.

, , , and . Oper. Res. Lett., 40 (4): 287-291 (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

Scheduling a pipelined operator graph., and . SODA, page 207-212. ACM/SIAM, (2000)Performance Guarantees of Local Search for Multiprocessor Scheduling., and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 370-382. Springer, (2001)Preemptive Scheduling with Job-Dependent Setup Times., and . SODA, page 759-767. ACM/SIAM, (1999)Non-approximability Results for Scheduling Problems with Minsum Criteria., , and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 353-366. Springer, (1998)De Bruijn Graphs and DNA Graphs., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 296-305. Springer, (2001)Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling., , , and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 108-119. Springer, (2010)Performance Guarantees of Local Search for Multiprocessor Scheduling., and . INFORMS J. Comput., 19 (1): 52-63 (2007)Performance guarantees of jump neighborhoods on restricted related parallel machines., , , and . Oper. Res. Lett., 40 (4): 287-291 (2012)A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem., and . Theor. Comput. Sci., 237 (1-2): 105-122 (2000)A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays.. Oper. Res. Lett., 23 (1-2): 9-11 (1998)