( en | de | ru )

 

Disambiguation of "Wu, Wen-Hsiang"

Author of the publication

copydeleteadd this publication to your clipboard
A study of the single-machine two-agent scheduling problem with release times.

, , , , and . Appl. Soft Comput., 13 (2): 998-1006 (2013)

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.

Wu Wen

Wen Wu

Hsiang-Huang Wu

Hsiang-Wen Hsu

Chieh-Hsiang Wu

 

Other publications of authors with the same name

Rasch model in data envelopment analysis: application in the international tourist hotel industry., , and . JORS, 64 (6): 938-944 (2013)Latent class model based diagnostic system utilizing traditional Chinese medicine for patients with systemic lupus erythematosus., , and . Expert Syst. Appl., 38 (1): 281-287 (2011)A single-machine scheduling with a truncated linear deterioration and ready times., , , , , and . Inf. Sci., (2014)A tabu method for a two-agent single-machine scheduling with deterioration jobs., , , , , and . Comput. Oper. Res., 40 (8): 2116-2127 (2013)The single-machine total tardiness problem with unequal release times and a linear deterioration., , , , and . Appl. Math. Comput., 219 (20): 10401-10415 (2013)Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration., , , , and . Asia Pac. J. Oper. Res., (2014)Fuzzy clustering algorithm for latent class model., , and . Stat. Comput., 14 (4): 299-310 (2004)Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method., , , , , , and . Oper. Res., 24 (1): 2 (March 2024)Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem., , , , and . Soft Comput., 20 (4): 1329-1339 (2016)A two-agent single-machine scheduling problem to minimize the total cost with release dates., , , , , and . Soft Comput., 21 (3): 805-816 (2017)