PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Tong, Weitian"

Author of the publication

copydeleteadd this publication to your clipboard
Machine scheduling with a maintenance interval and job delivery coordination.

, , , , , , , and . Optimization Letters, 10 (8): 1645-1656 (2016)

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.

Vinh Tong University of Stuttgart

 

Other publications of authors with the same name

An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops., , , and . Theor. Comput. Sci., (2018)An FPTAS for the parallel two-stage flowshop problem., , , , , , and . Theor. Comput. Sci., (2017)Efficient spatiotemporal interpolation with spark machine learning., , , and . Earth Science Informatics, 12 (1): 87-96 (2019)A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan., , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 227-237. Springer, (2016)Approximation Algorithms for the Maximum Multiple RNA Interaction Problem., , , and . COCOA, volume 8287 of Lecture Notes in Computer Science, page 49-59. Springer, (2013)Modeling Housing Rent in the Atlanta Metropolitan Area Using Textual Information and Deep Learning., , and . ISPRS Int. J. Geo-Information, 8 (8): 349 (2019)A local search 4/3-approximation algorithm for the minimum 3-path partition problem., , , , , , , and . CoRR, (2018)Algorithms for Cut Problems on Trees., , , , , , , , , and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 283-298. Springer, (2014)An Improved Approximation Algorithm for the Bandpass Problem., , , and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 351-358. Springer, (2012)A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops., , , and . European Journal of Operational Research, 281 (1): 16-24 (2020)