( en | de | ru )

 

Disambiguation of "Hsu, Peng-Hsiang"

Author of the publication

copydeleteadd this publication to your clipboard
Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration.

, , , , and . Asia Pac. J. Oper. Res., (2014)

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.

Hsiang-Hsu Wang

Hsiang-Wen Hsu

Hsiang-Hao Hsu

Peng-Hsiang Wang

Hsiang Kuang

 

Other publications of authors with the same name

A single-machine scheduling with a truncated linear deterioration and ready times., , , , , and . Inf. Sci., (2014)Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration., , , , and . Asia Pac. J. Oper. Res., (2014)A bi-criterion sequence-dependent scheduling problem with order deliveries., , , , , , , and . PeerJ Comput. Sci., (2024)A two-agent single-machine scheduling problem to minimize the total cost with release dates., , , , , and . Soft Comput., 21 (3): 805-816 (2017)Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times., , , and . Comput. Oper. Res., 38 (7): 1025-1034 (2011)A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect., , , , , , and . Soft Comput., 24 (14): 10515-10533 (2020)Solving a two-agent single-machine scheduling problem considering learning effect., and . Comput. Oper. Res., 39 (7): 1644-1651 (2012)Factors affecting satisfaction and brand loyalty to smartphone systems: a perceived benefits perspective., , , , and . Int. J. Mob. Commun., 16 (5): 513-534 (2018)A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations., , , , and . Comput. Ind. Eng., 60 (4): 534-541 (2011)Two-machine flowshop scheduling with truncated learning to minimize the total completion time., , , and . Comput. Ind. Eng., 61 (3): 655-662 (2011)