Jianyou Xu

According to our database, Jianyou Xu authored at least 9 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A bi-criterion sequence-dependent scheduling problem with order deliveries.

Jianyou Xu, Win-Chin Lin, Kai-Xiang Hu, Yu-Wei Chang, Wen-Hsiang Wu, Peng-Hsiang Hsu, Tsung-Hsien Wu, Chin-Chia Wu

PeerJ Comput. Sci., 2024

2022

A bicriterion single-machine scheduling problem with step-improving processing times.

Chin-Chia Wu, Win-Chin Lin, Ameni Azzouz, Jianyou Xu, Yen-Lin Chiu, Yung-Wei Tsai, Pengyi Shen

Comput. Ind. Eng., 2022

2019

Artificial bee colony algorithms for the order scheduling with release dates.

Win-Chin Lin, Jianyou Xu, Danyu Bai, I-Hong Chung, Shang-Chia Liu, Chin-Chia Wu

Soft Comput., 2019

2017

An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times.

Jianyou Xu, Chin-Chia Wu, Yunqiang Yin, Win-Chin Lin

Appl. Soft Comput., 2017

2016

Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration.

Jianyou Xu, Win-Chin Lin, Junjie Wu, Shuenn-Ren Cheng, Zi-Ling Wang, Chin-Chia Wu

Int. J. Comput. Intell. Syst., 2016

An order scheduling problem with position-based learning effect.

Jianyou Xu, Chin-Chia Wu, Yunqiang Yin, Chuanli Zhao, Yi-Tang Chiou, Win-Chin Lin

Comput. Oper. Res., 2016

2014

A single-machine scheduling with a truncated linear deterioration and ready times.

Chin-Chia Wu, Wen-Hsiang Wu, Wen-Hung Wu, Peng-Hsiang Hsu, Yunqiang Yin, Jianyou Xu

Inf. Sci., 2014

A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan.

Jianyou Xu, Yunqiang Yin, T. C. E. Cheng, Chin-Chia Wu, Shusheng Gu

Appl. Soft Comput., 2014

2013

A tabu method for a two-agent single-machine scheduling with deterioration jobs.

Wen-Hsiang Wu, Jianyou Xu, Wen-Hung Wu, Yunqiang Yin, I-Fan Cheng, Chin-Chia Wu

Comput. Oper. Res., 2013